Advertisement

Clairvoyant Mechanisms for Online Auctions

  • Philipp BrandesEmail author
  • Zengfeng Huang
  • Hsin-Hao Su
  • Roger Wattenhofer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9797)

Abstract

In this paper we consider online auctions with buyback; a form of auctions where bidders arrive sequentially and the bidders have to be accepted or rejected immediately. Each bidder has a valuation for being allocated the good and a preemption price. Sold goods can be bought back from the bidders for a preemption price. We allow unbounded valuations and preemption prices independent from each other. We study the clairvoyant model, a model sitting between the traditional offline and online models. In the clairvoyant model, a sequence of all potential customers (their bids and compensations) is known in advance to the seller, but the seller does not know when the sequence stops. In the case of a single good, we present an algorithm for computing the difficulty \(\varDelta \), the optimal ratio between the clairvoyant mechanism and the pure offline mechanism (which knows when the sequence stops, and can simply sell the good to the customer with the highest bid, without having to pay any compensations). We also present an optimal clairvoyant mechanism if there are multiple goods to be sold. If the number of goods is unbounded, however, we show that the problem in the clairvoyant model becomes \(\mathcal {NP}\)-hard. Based on our results in the clairvoyant model, we study the \(\varDelta \)-online problem (where the sequence is unknown to the mechanism, but the difficulty \(\varDelta \) of the input sequence is known). We show that there is a tight gap of \(\varTheta (\varDelta ^5)\) between the offline and the online model.

References

  1. 1.
    Varadaraja, A.B.: Buyback problem - approximate matroid intersection with cancellation costs. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 379–390. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  2. 2.
    Varadaraja, A.B., Kleinberg, R.: Randomized online algorithms for the buyback problem. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 529–536. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  3. 3.
    Babaioff, M., Hartline, J.D., Kleinberg, R.: Selling ad campaigns: online algorithms with cancellations. In: EC, pp. 61–70 (2009)Google Scholar
  4. 4.
    Chrobak, M., Kenyon, C., Noga, J., Young, N.E.: Incremental medians via online bidding. Algorithmica 50, 455–478 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Clarke, E.H.: Multipart pricing of public goods. Public Choice 11(1), 17–33 (1971)CrossRefGoogle Scholar
  6. 6.
    Constantin, F., Feldman, J., Muthukrishnan, S., Pál, M.: An online mechanism for ad slot reservations with cancellations. In: SODA, pp. 1265–1274 (2009)Google Scholar
  7. 7.
    Dasgupta, S., Long, P.M.: Performance guarantees for hierarchical clustering. J. Comput. Syst. Sci. 70(4), 555–569 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Friedman, E.J., Parkes, D.C.: Pricing WiFi at Starbucks: issues in online mechanism design. In: EC, pp. 240–241 (2003)Google Scholar
  9. 9.
    Fung, S.P.Y.: Online scheduling of unit length jobs with commitment and penalties. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds.) TCS 2014. LNCS, vol. 8705, pp. 54–65. Springer, Heidelberg (2014)Google Scholar
  10. 10.
    Gilbert, J., Mosteller, F.: Recognizing the maximum of a sequence. J. Am. Stat. Assoc. 61(313), 35–73 (1966)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Groves, T.: Incentives in teams. Econom.: J. Econom. Soc. 41, 617–631 (1973)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Hajiaghayi, M.T.: Online auctions with re-usable goods. In: EC (2005)Google Scholar
  13. 13.
    Hajiaghayi, M.T., Kleinberg, R.D., Parkes, D.C.: Adaptive limited-supply online auctions. In: EC, pp. 71–80 (2004)Google Scholar
  14. 14.
    Han, X., Kawase, Y., Makino, K.: Online knapsack problem with removal cost. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 61–73. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  15. 15.
    Hartline, J., Sharp, A.: An incremental model for combinatorial maximization problems. In: Àlvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol. 4007, pp. 36–48. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  16. 16.
    Hartline, J., Sharp, A.: Incremental flow. Networks 50(1), 77–85 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Kawase, Y., Han, X., Makino, K.: Unit cost buyback problem. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 435–445. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  18. 18.
    Lavi, R., Nisan, N.: Competitive analysis of incentive compatible on-line auctions. In: EC, pp. 233–241 (2000)Google Scholar
  19. 19.
    Lavi, R., Nisan, N.: Online ascending auctions for gradually expiring items. In: SODA, pp. 1146–1155 (2005)Google Scholar
  20. 20.
    Lindley, D.V.: Dynamic programming and decision theory. j-APPL-STAT 10(1), 39–51 (1961)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Mettu, R.R., Plaxton, C.G.: The online median problem. In: FOCS (2000)Google Scholar
  22. 22.
    Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)CrossRefzbMATHGoogle Scholar
  23. 23.
    Parkes, D.C., Singh, S.P.: An MDP-based approach to online mechanism design. In: NIPS (2003)Google Scholar
  24. 24.
    Parkes, D.C., Singh, S.P., Yanovsky, D.: Approximately efficient online mechanism design. In: NIPS (2004)Google Scholar
  25. 25.
    Plaxton, C.G.: Approximation algorithms for hierarchical location problems. In: STOC, pp. 40–49 (2003)Google Scholar
  26. 26.
    Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. J. Financ. 16(1), 8–37 (1961)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Philipp Brandes
    • 1
    Email author
  • Zengfeng Huang
    • 2
  • Hsin-Hao Su
    • 3
  • Roger Wattenhofer
    • 1
  1. 1.ETH ZurichZürichSwitzerland
  2. 2.UNSWKensingtonAustralia
  3. 3.MITCambridgeUSA

Personalised recommendations