Advertisement

Unit Cost Buyback Problem

  • Yasushi Kawase
  • Xin Han
  • Kazuhisa Makino
Article
  • 13 Downloads

Abstract

In this paper, we study the unit cost buyback problem, i.e., the buyback problem with a fixed cancellation cost for each canceled element. The input of the problem is a sequence of elements e1, e2, . . . , en where each element ei has a weight w(ei). We assume that the weights are in a known range [l, u], i.e., lw(ei) ≤ u for any i. Given the i th element ei, we either accept ei or reject it with no cost, where we can keep a set of elements that satisfies a certain constraint. In order to accept a new element ei, we can cancel some previously selected elements at a cost which is proportional to the number of elements canceled. Our goal is to maximize the profit, i.e., the total weights of elements accepted (and not canceled) minus the total cancellation cost occurred. We construct optimal online algorithms and prove that they are the best possible when the constraint is a matroid constraint or the unweighted knapsack constraint.

Keywords

Online algorithm Competitive analysis Buyback problem Matroid Knapsack problem 

Notes

Acknowledgements

The first author was supported by JST, ERATO, Kawarabayashi Large Graph Project and JSPS KAKENHI Grant Numbers 26887014 and 16K16005. The second author was supported by RGC (HKU716412E) and NSFC (11571060). The last author was supported by JSPS KAKENHI Grant Number JP24106002, JP25280004, JP26280001, and JST CREST Grant Number JPMJCR1402.

References

  1. 1.
    Ashwinkumar, B.V.: Buyback problem - approximate matroid intersection with cancellation costs. In: Proceedings of the 38th International Colloquium on Automata, Language and Programming, pp. 379–390 (2011)Google Scholar
  2. 2.
    Ashwinkumar, B.V., Kleinberg, R.: Randomized online algorithms for the buyback problem. In: Internet and network economics, pp. 529–536 (2009)Google Scholar
  3. 3.
    Babaioff, M., Hartline, J.D., Kleinberg, R.D.: Selling banner ads: online algorithms with buyback. In: Proceedings of the 4th Workshop on Ad Auctions (2008)Google Scholar
  4. 4.
    Babaioff, M., Hartline, J.D., Kleinberg, R. D.: Selling ad campaigns: online algorithms with cancel- lations. In: Proceedings of the 10th ACM Conference on Electronic Commerce, pp. 61–70 (2009)Google Scholar
  5. 5.
    Biyalogorsky, E., Carmon, Z., Fruchter, G.E., Gerstner, E.: Research note: overselling with opportunistic cancellations. Mark. Sci. 18(4), 605–610 (1999)CrossRefGoogle Scholar
  6. 6.
    Constantin, F., Feldman, J., Muthukrishnan, S., Pál, M.: An online mechanism for ad slot reservations with cancellations. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1265–1274 (2009)CrossRefGoogle Scholar
  7. 7.
    Fukuda, S., Shioura, A., Tokuyama, T.: Buyback problem with discrete concave valuation functions. Discret. Optim. 26, 78–96 (2017)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Han, X., Kawase, Y., Makino, K.: Online unweighted knapsack problem with removal cost. Algorithmica 70, 76–91 (2014)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Han, X., Kawase, Y., Makino, K.: Randomized algorithms for online knapsack problems. Theor. Comput. Sci. 562, 395–405 (2015)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Han, X., Kawase, Y., Makino, K., Guo, H.: Online knapsack problem under convex function. Theor. Comput. Sci. 540–5419, 62–69 (2014)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Han, X., Makino, K.: Online minimization knapsack problem. Theor. Comput. Sci. 609, 185–196 (2016)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Iwama, K., Taketomi, S.: Removable online knapsack problems. In: Proceeding of the 29th International Colloquium on Automata, Languages and Programming, pp. 293–305 (2002)CrossRefGoogle Scholar
  13. 13.
    Iwama, K., Zhang, G.: Optimal resource augmentations for online knapsack. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 180–188 (2007)CrossRefGoogle Scholar
  14. 14.
    Kawase, Y., Han, X., Makino, K.: Unit cost buyback problem. In: Proceedings of the 24th International Symposium on Algorithms and Computation, pp. 435–445 (2013)CrossRefGoogle Scholar
  15. 15.
    Kawase, Y., Han, X., Makino, K.: Proportional cost buyback problem with weight bounds. Theoretical Computer Science (2016)Google Scholar
  16. 16.
    Noga, J., Sarbua, V.: An online partially fractional knapsack problem. In: Proceedings of 8th International Symposium on Parallel Architectures, Algorithms and Networks, pp. 108–112 (2005)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.School of EngineeringTokyo Institute of TechnologyTokyoJapan
  2. 2.Software SchoolDalian University of TechnologyDalianChina
  3. 3.Research Institute for Mathematical SciencesKyoto UniversityKyotoJapan

Personalised recommendations