IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v118y2019icp494-510.html
   My bibliography  Save this article

Optimal auctions vs. anonymous pricing

Author

Listed:
  • Alaei, Saeed
  • Hartline, Jason
  • Niazadeh, Rad
  • Pountourakis, Emmanouil
  • Yuan, Yang

Abstract

For selling a single item to agents with independent but non-identically distributed values, the revenue optimal auction is complex. With respect to it, Hartline and Roughgarden (2009) showed that the approximation factor of the second-price auction with an anonymous reserve is between two and four. We consider the more demanding problem of approximating the revenue of the ex ante relaxation of the auction problem by posting an anonymous price and derive a formula for their worst-case ratio, denoted ρ, that numerically evaluates to e. As a corollary, the upper-bound of anonymous pricing or anonymous reserves versus the optimal auction improves from four to ρ≈e. We conclude that, up to the factor ρ, discrimination and simultaneity are unimportant for driving revenue in single-item auctions.

Suggested Citation

  • Alaei, Saeed & Hartline, Jason & Niazadeh, Rad & Pountourakis, Emmanouil & Yuan, Yang, 2019. "Optimal auctions vs. anonymous pricing," Games and Economic Behavior, Elsevier, vol. 118(C), pages 494-510.
    • Handle: RePEc:eee:gamebe:v:118:y:2019:i:c:p:494-510
    DOI: 10.1016/j.geb.2018.08.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S089982561830126X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2018.08.003?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Devanur, Nikhil R. & Hartline, Jason D. & Yan, Qiqi, 2015. "Envy freedom and prior-free mechanism design," Journal of Economic Theory, Elsevier, vol. 156(C), pages 103-143.
    2. Shuchi Chawla & Jason Hartline & David Malec & Balasubramanian Sivan, 2010. "Sequential Posted Pricing and Multi-parameter Mechanism Design," Discussion Papers 1486, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. Jason D. Hartline, 2012. "Approximation in Mechanism Design," American Economic Review, American Economic Association, vol. 102(3), pages 330-336, May.
    4. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bergemann, Dirk & Castro, Francisco & Weintraub, Gabriel, 2022. "Third-degree price discrimination versus uniform pricing," Games and Economic Behavior, Elsevier, vol. 131(C), pages 275-291.
    2. Rad Niazadeh & Negin Golrezaei & Joshua Wang & Fransisca Susan & Ashwinkumar Badanidiyuru, 2023. "Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization," Management Science, INFORMS, vol. 69(7), pages 3797-3817, July.
    3. Adam N. Elmachtoub & Michael L. Hamilton, 2021. "The Power of Opaque Products in Pricing," Management Science, INFORMS, vol. 67(8), pages 4686-4702, August.
    4. Saeed Alaei & Ali Makhdoumi & Azarakhsh Malekian & Rad Niazadeh, 2022. "Descending Price Auctions with Bounded Number of Price Levels and Batched Prophet Inequality," Papers 2203.01384, arXiv.org.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Saeed Alaei & Ali Makhdoumi & Azarakhsh Malekian & Rad Niazadeh, 2022. "Descending Price Auctions with Bounded Number of Price Levels and Batched Prophet Inequality," Papers 2203.01384, arXiv.org.
    2. Kleinberg, Robert & Weinberg, S. Matthew, 2019. "Matroid prophet inequalities and applications to multi-dimensional mechanism design," Games and Economic Behavior, Elsevier, vol. 113(C), pages 97-115.
    3. Nima Anari & Rad Niazadeh & Amin Saberi & Ali Shameli, 2018. "Linear Programming Based Near-Optimal Pricing for Laminar Bayesian Online Selection," Papers 1807.05477, arXiv.org, revised Mar 2024.
    4. Debasis Mishra & Kolagani Paramahamsa, 2022. "Selling to a principal and a budget-constrained agent," Discussion Papers 22-02, Indian Statistical Institute, Delhi.
    5. Briest, Patrick & Chawla, Shuchi & Kleinberg, Robert & Weinberg, S. Matthew, 2015. "Pricing lotteries," Journal of Economic Theory, Elsevier, vol. 156(C), pages 144-174.
    6. Chawla, Shuchi & Malec, David & Sivan, Balasubramanian, 2015. "The power of randomness in Bayesian optimal mechanism design," Games and Economic Behavior, Elsevier, vol. 91(C), pages 297-317.
    7. Cai, Yang & Daskalakis, Constantinos, 2015. "Extreme value theorems for optimal multidimensional pricing," Games and Economic Behavior, Elsevier, vol. 92(C), pages 266-305.
    8. Chen, Xi & Diakonikolas, Ilias & Paparas, Dimitris & Sun, Xiaorui & Yannakakis, Mihalis, 2018. "The complexity of optimal multidimensional pricing for a unit-demand buyer," Games and Economic Behavior, Elsevier, vol. 110(C), pages 139-164.
    9. Li, Yunan, 2017. "Approximation in mechanism design with interdependent values," Games and Economic Behavior, Elsevier, vol. 103(C), pages 225-253.
    10. Hart, Sergiu & Nisan, Noam, 2017. "Approximate revenue maximization with multiple items," Journal of Economic Theory, Elsevier, vol. 172(C), pages 313-347.
    11. Yannai A. Gonczarowski & Nicole Immorlica & Yingkai Li & Brendan Lucier, 2021. "Revenue Maximization for Buyers with Costly Participation," Papers 2103.03980, arXiv.org, revised Nov 2023.
    12. Devanur, Nikhil R. & Hartline, Jason D. & Yan, Qiqi, 2015. "Envy freedom and prior-free mechanism design," Journal of Economic Theory, Elsevier, vol. 156(C), pages 103-143.
    13. Alon Eden & Michal Feldman & Ophir Friedler & Inbal Talgam-Cohen & S. Matthew Weinberg, 2021. "A Simple and Approximately Optimal Mechanism for a Buyer with Complements," Operations Research, INFORMS, vol. 69(1), pages 188-206, January.
    14. Yann Disser & John Fearnley & Martin Gairing & Oliver Göbel & Max Klimm & Daniel Schmand & Alexander Skopalik & Andreas Tönnis, 2020. "Hiring Secretaries over Time: The Benefit of Concurrent Employment," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 323-352, February.
    15. Loertscher, Simon & Marx, Leslie M., 2020. "Asymptotically optimal prior-free clock auctions," Journal of Economic Theory, Elsevier, vol. 187(C).
    16. Tim Roughgarden & Inbal Talgam-Cohen & Qiqi Yan, 2019. "Robust Auctions for Revenue via Enhanced Competition," Operations Research, INFORMS, vol. 68(4), pages 1074-1094, July.
    17. Aadityan Ganesh & Jason Hartline, 2023. "Combinatorial Pen Testing (or Consumer Surplus of Deferred-Acceptance Auctions)," Papers 2301.12462, arXiv.org, revised Dec 2024.
    18. Azar, Pablo D. & Kleinberg, Robert & Weinberg, S. Matthew, 2019. "Prior independent mechanisms via prophet inequalities with limited information," Games and Economic Behavior, Elsevier, vol. 118(C), pages 511-532.
    19. Constantinos Daskalakis & Maxwell Fishelson & Brendan Lucier & Vasilis Syrgkanis & Santhoshini Velusamy, 2020. "Multi-item Non-truthful Auctions Achieve Good Revenue," Papers 2002.06702, arXiv.org, revised Sep 2022.
    20. Tang, Pingzhong & Wang, Zihe, 2017. "Optimal mechanisms with simple menus," Journal of Mathematical Economics, Elsevier, vol. 69(C), pages 54-70.

    More about this item

    Keywords

    Auction theory; Mechanism design; Second price auction; Anonymous pricing; Optimal auction;
    All these keywords.

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:118:y:2019:i:c:p:494-510. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.