Simple, Optimal and Efficient Auctions

  • Constantinos Daskalakis
  • George Pierrakos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7090)


We study the extent to which simple auctions can simultaneously achieve good revenue and efficiency guarantees in single-item settings. Motivated by the optimality of the second price auction with monopoly reserves when the bidders’ values are drawn i.i.d. from regular distributions [12], and its approximate optimality when they are drawn from independent regular distributions [11], we focus our attention to the second price auction with general (not necessarily monopoly) reserve prices, arguably one of the simplest and most intuitive auction formats. As our main result, we show that for a carefully chosen set of reserve prices this auction guarantees at least 20% of both the optimal welfare and the optimal revenue, when the bidders’ values are distributed according to independent, not necessarily identical, regular distributions. We also prove a similar guarantee, when the values are drawn i.i.d. from a—possibly irregular—distribution.


Reserve Price Combinatorial Auction Price Auction Regular Distribution English 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.
    Abhishek, V., Hajek, B.E.: Efficiency loss in revenue optimal auctions. In: CDC, pp. 1082–1087 (2010)Google Scholar
  2. 2.
    Aggarwal, G., Goel, G., Mehta, A.: Efficiency of (revenue-)optimal mechanisms. In: ACM Conference on Electronic Commerce, pp. 235–242 (2009)Google Scholar
  3. 3.
    Alaei, S.: Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. In: FOCS (2011)Google Scholar
  4. 4.
    Bulow, J., Klemperer, P.: Auctions versus negotiations. American Economic Review 86(1), 180–194 (1996)Google Scholar
  5. 5.
    Cai, Y., Daskalakis, C.: Extreme-value theorems for optimal multidimensional pricing. In: FOCS (2011)Google Scholar
  6. 6.
    Chawla, S., Hartline, J.D., Malec, D.L., Sivan, B.: Multi-parameter mechanism design and sequential posted pricing. In: STOC, pp. 311–320 (2010)Google Scholar
  7. 7.
    Dhangwatnotai, P., Roughgarden, T., Yan, Q.: Revenue maximization with a single sample. In: ACM Conference on Electronic Commerce, pp. 129–138 (2010)Google Scholar
  8. 8.
    Diakonikolas, I., Papadimitriou, C., Pierrakos, G., Singer, Y.: Complexity of efficiency-revenue trade-offs in bayesian auctionsGoogle Scholar
  9. 9.
    Dughmi, S., Roughgarden, T., Sundararajan, M.: Revenue submodularity. In: ACM Conference on Electronic Commerce, pp. 243–252 (2009)Google Scholar
  10. 10.
    Hartline, J.: Lectures on approximation in mechanism design. Lecture notes. Northwestern University (2010)Google Scholar
  11. 11.
    Hartline, J.D., Roughgarden, T.: Simple versus optimal mechanisms. In: ACM Conference on Electronic Commerce, pp. 225–234 (2009)Google Scholar
  12. 12.
    Myerson, R.B.: Optimal auction design. Mathematics of Operations Research 6, 58–73 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Myerson, R.B., Satterthwaite, M.A.: Efficient mechanisms for bilateral trading. Journal of Economic Theory 29(2), 265–281 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Neeman, Z.: The effectiveness of english auctions. Games and Economic Behavior 43(2), 214–238 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Samuel-Cahn, E.: Comparison of threshold stop rules and maximum for independent nonnegative random variables. The Annals of Probability 12(4), 1213–1216 (1984)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Constantinos Daskalakis
    • 1
  • George Pierrakos
    • 2
  2. 2.EECSUC BerkeleyUSA

Personalised recommendations