Limited Supply Online Auctions for Revenue Maximization

  • Piotr Krysta
  • Orestis Telelis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7695)


We consider the design of competitive truthful auctions for prior-free revenue maximization, to sell copies of a single good in limited supply to unit-demand bidders that arrive online. The online model, first studied in [Hajiaghayi, Kleinberg, Parkes, ACM EC 2004] and recently revisited in [Koutsoupias and Pierrakos, WINE 2010], is reminiscent of the secretary problem, in that the order of the bidders’ arrival is chosen uniformly at random. The benchmark against which the generated revenue is compared is the one introduced by Goldberg et al. [Games and Economic Behavior 55(2):242–269, 2006]. We consider two variants of limited supply; a hard constraint of k available copies and convex production cost curve for each copy. For each case we present an algorithmic reduction of the problem to the problem of unlimited supply studied by Koutsoupias and Pierrakos. Our reduction for the case of k available copies yields a 26e-competitive auction thus improving significantly upon the best known ratio of 6338, from [Hajiaghayi, Kleinberg, Parkes, ACM EC 2004].


Competitive Ratio Sampling Phase Electronic Commerce Limited Supply Online Auction 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alaei, S., Malekian, A., Srinivasan, A.: On random sampling auctions for digital goods. In: Proceedings of the 10th ACM Conference on Electronic Commerce (EC), pp. 187–196. ACM, New York (2009)Google Scholar
  2. 2.
    Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online auctions and generalized secretary problems. SIGecom Exchanges 7(2) (2008)Google Scholar
  3. 3.
    Feige, U., Flaxman, A., Hartline, J.D., Kleinberg, R.: On the Competitive Ratio of the Random Sampling Auction. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol. 3828, pp. 878–886. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Goldberg, A., Hartline, J., Karlin, A., Saks, M., Wright, A.: Competitive Auctions. Games and Economics Behavior 55(2), 242–269 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Hajiaghayi, M.T., Kleinberg, R.D., Parkes, D.C.: Adaptive limited-supply online auctions. In: Proceedings of the 5th ACM Conference on Electronic Commerce (EC), pp. 71–80. ACM, New York (2004)Google Scholar
  6. 6.
    Hartline, J., McGrew, A.: From optimal limited to unlimited supply auctions. In: Proceedings of the 6th ACM Conference on Electronic Commerce (EC), pp. 175–182. ACM, New York (2005)Google Scholar
  7. 7.
    Koutsoupias, E., Pierrakos, G.: On the Competitive Ratio of Online Sampling Auctions. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 327–338. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  8. 8.
    Myerson, R.B.: Optimal Auction Design. Mathematics of Operations Research 6(1), 58–73 (1981)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Piotr Krysta
    • 1
  • Orestis Telelis
    • 2
  1. 1.Department of Computer ScienceUniversity of LiverpoolU.K.
  2. 2.Dept. of InformaticsAthens University of Economics and BusinessGreece

Personalised recommendations