Advertisement

Applications of \(\alpha \)-Strongly Regular Distributions to Bayesian Auctions

  • Richard Cole
  • Shravas Rao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9470)

Abstract

Two classes of distributions that are widely used in the analysis of Bayesian auctions are the Monotone Hazard Rate (MHR) and Regular distributions. They can both be characterized in terms of the rate of change of the associated virtual value functions: for MHR distributions the condition is that for values \(v < v'\), \(\phi (v') - \phi (v) \ge v' - v\), and for regular distributions, \(\phi (v') - \phi (v) \ge 0\). Cole and Roughgarden introduced the interpolating class of \(\alpha \)-Strongly Regular distributions (\(\alpha \)-SR distributions for short), for which \(\phi (v') - \phi (v) \ge \alpha (v' - v)\), for \(0 \le \alpha \le 1\). In this paper, we investigate five distinct auction settings for which good expected revenue bounds are known when the bidders’ valuations are given by MHR distributions. In every case, we show that these bounds degrade gracefully when extended to \(\alpha \)-SR distributions. For four of these settings, the auction mechanism requires knowledge of these distribution(s) (in the other setting, the distributions are needed only to ensure good bounds on the expected revenue). In these cases we also investigate what happens when the distributions are known only approximately via samples, specifically how to modify the mechanisms so that they remain effective and how the expected revenue depends on the number of samples.

Notes

Acknowledgements

We thank the referees for their thoughtful comments.

References

  1. 1.
    Bhattacharya, S., Goel, G., Gollapudi, S., Munagala, K.: Budget constrained auctions with heterogeneous items. In: STOC, pp. 379–388 (2010)Google Scholar
  2. 2.
    Chawla, S., Malec, D.L., Malekian, A.: Bayesian mechanism design for budget-constrained agents. In: EC, pp. 253–262 (2011)Google Scholar
  3. 3.
    Cole, R., Roughgarden, T.: The sample complexity of revenue maximization. In: Symposium on Theory of Computing, STOC 2014, New York, NY, USA, pp. 243–252, 31 May–03 June 2014Google Scholar
  4. 4.
    Dhangwatnotai, P., Roughgarden, T., Yan, Q.: Revenue maximization with a single sample. In: EC, pp. 129–138 (2010)Google Scholar
  5. 5.
    Hartline, J.D.: Mechanism design and approximation. Book draft (2014)Google Scholar
  6. 6.
    Hartline, J.D., Karlin, A.: Profit maximization in mechanism design. In: Nisan, N., Roughgarden, T., Tardos, É., Vazirani, V.V. (eds.) Algorithmic Game Theory, chapt. 13, pp. 331–362. Cambridge University Press, Cambridge (2007)CrossRefGoogle Scholar
  7. 7.
    Hartline, J.D., Roughgarden, T.: Simple versus optimal mechanisms. In: EC, pp. 225–234 (2009)Google Scholar
  8. 8.
    Myerson, R.B.: Optimal auction design. Math. Oper. Res. 6(1), 58–73 (1981)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

Authors and Affiliations

  1. 1.Computer Science Department, Courant InstituteNYUNew YorkUSA

Personalised recommendations