Abstract
This work investigates an online two stage k-search problem where an online player makes selections in two stages. In the first stage a number of more than k quoted prices are selected as candidates, and then exactly k highest quoted prices are chosen from the candidates in the second stage. The objective is to maximize the total profit of the k final accepted prices. We mainly propose a deterministic online algorithm and prove that it is optimal in competitiveness. A further discussion is given considering various relationships between the value of k and the number of candidates.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
