skip to main content
research-article
Public Access

Applications of α-Strongly Regular Distributions to Bayesian Auctions

Published:22 December 2017Publication History
Skip Abstract Section

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, ϕ (v) - ϕ (v) ≥ v - v, and for regular distributions, ϕ (v) - ϕ (v) ≥ 0. Cole and Roughgarden introduced the interpolating class of α-strongly regular distributions (α-SR distributions for short), for which ϕ (v) - ϕ (v) ≥ α (v - v), for 0 ≤ α ≤ 1.

In this article, 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 α-SR distributions. For four of these settings, the auction mechanism requires knowledge of these distributions (in the remaining 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.

References

  1. Gagan Aggarwal, Gagan Goel, and Aranyak Mehta. 2009. Efficiency of (revenue-)optimal mechanisms. In Proceedings of the 10th ACM Conference on Electronic Commerce (EC’09). ACM, New York, NY, 235--242. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Simon P. Anderson and Regis Renault. 2003. Efficiency and surplus bounds in Cournot competition. Journal of Economic Theory 113, 2, 253--264.Google ScholarGoogle ScholarCross RefCross Ref
  3. Pablo Azar, Constantinos Daskalakis, Silvio Micali, and S. Matthew Weinberg. 2013. Optimal and efficient parametric auctions. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’13). 596--604. http://dl.acm.org/citation.cfm?id&equals;2627817.2627860. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Sayan Bhattacharya, Gagan Goel, Sreenivas Gollapudi, and Kamesh Munagala. 2012. Budget-constrained auctions with heterogeneous items. Theory of Computing 8, 1, 429--460.Google ScholarGoogle ScholarCross RefCross Ref
  5. Andrew Caplin and Barry Nalebuff. 1991. Aggregation and imperfect competition: On the existence of equilibrium. Econometrica 25, 1--24.Google ScholarGoogle ScholarCross RefCross Ref
  6. Andrew Caplin and Barry Nalebuff. 1991. Aggregation and social choice: A mean voter theorem. Econometrica 25, 25--59.Google ScholarGoogle ScholarCross RefCross Ref
  7. Shuchi Chawla, David L. Malec, and Azarakhsh Malekian. 2011. Bayesian mechanism design for budget-constrained agents. In Proceedings of the 12th ACM Conference on Electronic Commerce (EC’11). ACM, New York, NY, 253--262. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Ludek Cigler, Wolfgang Dvorák, Monika Henzinger, and Martin Starnberger. 2014. Limiting price discrimination when selling products with positive network externalities. In Proceedings of the 10th International Conference on Web and Internet Economics (WINE’14). 44--47.Google ScholarGoogle ScholarCross RefCross Ref
  9. Richard Cole and Tim Roughgarden. 2014. The sample complexity of revenue maximization. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC’14). ACM, New York, NY, 243--252. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Constantinos Daskalakis and George Pierrakos. 2011. Simple, optimal and efficient auctions. In Proceedings of the 7th International Workshop on Internet and Network Economics (WINE’11). 109--121. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Peerapong Dhangwatnotai, Tim Roughgarden, and Qiqi Yan. 2015. Revenue maximization with a single sample. Games and Economic Behavior 91, 318--333.Google ScholarGoogle ScholarCross RefCross Ref
  12. Christian Ewerhart. 2013. Regular type distributions in mechanism design and -concavity. Economic Theory 53, 3, 591--603. http://ezproxy.library.nyu.edu:2048/login?url&equals;http://search.ebscohost.com/login.aspx?direct&equals;true8db&equals;bth8AN&equals;892418218site&equals;ehost-live.Google ScholarGoogle ScholarCross RefCross Ref
  13. Jason Hartline, Vahab Mirrokni, and Mukund Sundararajan. 2008. Optimal marketing strategies over social networks. In Proceedings of the 17th International Conference on World Wide Web (WWW’08). ACM, New York, NY, 189--198. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. J. D. Hartline. 2014. Mechanism Design and Approximation. Book draft.Google ScholarGoogle Scholar
  15. J. D. Hartline and A. Karlin. 2007. Profit maximization in mechanism design. In Algorithmic Game Theory, N. Nisan, T. Roughgarden, É. Tardos, and V. V. Vazirani (Eds.). Cambridge University Press, 331--362.Google ScholarGoogle Scholar
  16. Jason D. Hartline and Tim Roughgarden. 2009. Simple versus optimal mechanisms. ACM SIGecom Exchanges 8, 1, Article 5, 3 pages. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Robert Kleinberg and Yang Yuan. 2013. On the ratio of revenue to welfare in single-parameter mechanism design. In Proceedings of the 14th ACM Conference on Electronic Commerce (EC’13). ACM, New York, NY, 589--602. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Roger B. Myerson. 1981. Optimal auction design. Mathematics of Operations Research 6, 1, 58--73. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Nikolaus Schweizer and Nora Szech. 2015. The Quantitative View of MYerson Regularity. Discussion Papers, Research Unit: Economics of Change SP II 2015-307. Social Science Research Center Berlin (WZB). http://EconPapers.repec.org/RePEc:zbw:wzbeoc:spii2015307.Google ScholarGoogle Scholar

Index Terms

  1. Applications of α-Strongly Regular Distributions to Bayesian Auctions

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM Transactions on Economics and Computation
        ACM Transactions on Economics and Computation  Volume 5, Issue 4
        Special Issue on Wine'15
        November 2017
        146 pages
        ISSN:2167-8375
        EISSN:2167-8383
        DOI:10.1145/3174276
        Issue’s Table of Contents

        Copyright © 2017 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 22 December 2017
        • Accepted: 1 July 2017
        • Revised: 1 January 2017
        • Received: 1 July 2016
        Published in teac Volume 5, Issue 4

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader