Abstract
In this paper, we study the proportional cost buyback problem. The input is a sequence of elements e1,e2,…,en, each of which has a weight w(ei). We assume that weights have an upper and a lower bound, i.e., l≤w(ei)≤u for any i. Given the ith element ei, we either accept ei or reject it with no cost, subject to some constraint on the set of accepted elements. During the iterations, we could cancel some previously accepted elements at a cost that is proportional to the total weight of them. Our goal is to maximize the profit, i.e., the sum of the weights of elements kept until the end minus the total cancellation cost occurred. We consider a matroid and the unweighted knapsack constraints. For either case, we construct optimal online algorithms and prove that they are the best possible.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
