Abstract
In the matroid buyback problem, an algorithm observes a sequence of bids and must decide whether to accept each bid at the moment it arrives, subject to a matroid constraint on the set of accepted bids. Decisions to reject bids are irrevocable, whereas decisions to accept bids may be canceled at a cost which is a fixed fraction of the bid value. We present a new randomized algorithm for this problem, and we prove matching upper and lower bounds to establish that the competitive ratio of this algorithm, against an oblivious adversary, is the best possible. We also observe that when the adversary is adaptive, no randomized algorithm can improve the competitive ratio of the optimal deterministic algorithm. Thus, our work completely resolves the question of what competitive ratios can be achieved by randomized algorithms for the matroid buyback problem.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Babaioff, M., Hartline, J.D., Kleinberg, R.: Selling ad campaigns: online algorithms with buyback. In: Proc. 10th ACM Conference on Electronic Commerce (2009)
Constantin, F., Feldman, J., Muthukrishnan, S., Pál, M.: An online mechanism for ad slot reservations with cancellations. In: Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1265–1274 (2009)
Constantin, F., Feldman, J., Muthukrishnan, S., Pál, M.: An online mechanism for ad slot reservations with cancellations. In: Proc. 4th Workshop on Ad Auctions (2008)
Babaioff, M., Hartline, J.D., Kleinberg, R.: Online algorithms with buyback. In: Proc. 4th Workshop on Ad Auctions (2008)
Ben-David, S., Borodin, A., Karp, R., Tardos, G., Wigderson, A.: On the power of randomization in on-line algorithms. Algorithmica 11(1), 2–14 (1994)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Biyalogorsky, E., Carmon, Z., Fruchter, G.E., Gerstner, E.: Research note: Overselling with opportunistic cancellations. Marketing Science 18(4), 605–610 (1999)
Sandholm, T., Lesser, V.R.: Leveled commitment contracts and strategic breach. Games and Economic Behavior 35, 212–270 (2001)
Oxley, J.: Matroid Theory. Oxford University Press, Oxford (1992)
Yao, A.C.C.: Probabilistic computations: Toward a unified measure of complexity. In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 222–227. IEEE Computer Society, Los Alamitos (1977)
Ashwinkumar, B.V., Kleinberg, R.: Randomized online algorithms for the buyback problem. CoRR abs/0908.0043 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ashwinkumar, B.V., Kleinberg, R. (2009). Randomized Online Algorithms for the Buyback Problem. In: Leonardi, S. (eds) Internet and Network Economics. WINE 2009. Lecture Notes in Computer Science, vol 5929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10841-9_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-10841-9_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10840-2
Online ISBN: 978-3-642-10841-9
eBook Packages: Computer ScienceComputer Science (R0)