IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v66y2020i10p4417-4432.html
   My bibliography  Save this article

Prior-Independent Optimal Auctions

Author

Listed:
  • Amine Allouah

    (Graduate School of Business, Columbia University, New York, New York 10027)

  • Omar Besbes

    (Graduate School of Business, Columbia University, New York, New York 10027)

Abstract

Auctions are widely used in practice. Although auctions are also extensively studied in the literature, most of the developments rely on the significant common prior assumption. We study the design of optimal prior-independent selling mechanisms: buyers do not have any information about their competitors, and the seller does not know the distribution of values but only knows a general class to which it belongs. Anchored on the canonical model of buyers with independent and identically distributed values, we analyze a competitive ratio objective in which the seller attempts to optimize the worst-case fraction of revenues garnered compared with those of an oracle with knowledge of the distribution. We characterize properties of optimal mechanisms and in turn establish fundamental impossibility results through upper bounds on the maximin ratio. By also deriving lower bounds on the maximin ratio, we are able to crisply characterize the optimal performance for a spectrum of families of distributions. In particular, our results imply that a second price auction is an optimal mechanism when the seller only knows that the distribution of buyers has a monotone nondecreasing hazard rate, and it guarantees at least 71.53% of oracle revenues against any distribution within this class. Furthermore, a second price auction is near optimal when the class of admissible distributions is that of those with nondecreasing virtual value function (a.k.a. regular). Under this class, it guarantees a fraction of 50% of oracle revenues, and no mechanism can guarantee more than 55.6%.

Suggested Citation

  • Amine Allouah & Omar Besbes, 2020. "Prior-Independent Optimal Auctions," Management Science, INFORMS, vol. 66(10), pages 4417-4432, October.
    • Handle: RePEc:inm:ormnsc:v:66:y:2020:i:10:p:4417-4432
    DOI: 10.1287/mnsc.2019.3459
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/mnsc.2019.3459
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.2019.3459?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
    ---><---

    References listed on IDEAS

    as
    1. McAfee, R. Preston & McMillan, John, 1987. "Auctions with a stochastic number of bidders," Journal of Economic Theory, Elsevier, vol. 43(1), pages 1-19, October.
    2. Kim-Sau Chung & J.C. Ely, 2007. "Foundations of Dominant-Strategy Mechanisms," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 74(2), pages 447-476.
    3. Chaithanya Bandi & Dimitris Bertsimas, 2014. "Optimal Design for Multi-Item Auctions: A Robust Optimization Approach," Mathematics of Operations Research, INFORMS, vol. 39(4), pages 1012-1038, November.
    4. Sebastian Morris, 2022. "Introduction," India Studies in Business and Economics, in: Macroeconomic Policy in India Since the Global Financial Crisis, chapter 0, pages 1-21, Springer.
    5. Çağıl Koçyiğit & Garud Iyengar & Daniel Kuhn & Wolfram Wiesemann, 2020. "Distributionally Robust Mechanism Design," Management Science, INFORMS, vol. 66(1), pages 159-189, January.
    6. Dirk Bergemann & Benjamin Brooks & Stephen Morris, 2016. "Informationally Robust Optimal Auction Design," Working Papers 084_2016, Princeton University, Department of Economics, Econometric Research Program..
    7. Victor F. Araman & René Caldentey, 2009. "Dynamic Pricing for Nonperishable Products with Demand Learning," Operations Research, INFORMS, vol. 57(5), pages 1169-1188, October.
    8. , & , & ,, 2006. "Optimal auctions with ambiguity," Theoretical Economics, Econometric Society, vol. 1(4), pages 411-438, December.
    9. Vivek F. Farias & Benjamin Van Roy, 2010. "Dynamic Pricing with a Prior on Market Response," Operations Research, INFORMS, vol. 58(1), pages 16-29, February.
    10. Bose, Subir & Daripa, Arup, 2009. "A dynamic mechanism and surplus extraction under ambiguity," Journal of Economic Theory, Elsevier, vol. 144(5), pages 2084-2114, September.
    11. Omar Besbes & Assaf Zeevi, 2015. "On the (Surprising) Sufficiency of Linear Models for Dynamic Pricing with Demand Learning," Management Science, INFORMS, vol. 61(4), pages 723-739, April.
    12. Neeman, Zvika, 2003. "The effectiveness of English auctions," Games and Economic Behavior, Elsevier, vol. 43(2), pages 214-238, May.
    13. Vinicius Carrasco & Vitor Farinha Luz & Paulo Monteiro & Humberto Moreira, 2015. "Robust Selling Mechanisms," Textos para discussão 641, Department of Economics PUC-Rio (Brazil).
    14. Dirk Bergemann & Karl H. Schlag, 2012. "Pricing Without Priors," World Scientific Book Chapters, in: Robust Mechanism Design The Role of Private Information and Higher Order Beliefs, chapter 12, pages 405-415, World Scientific Publishing Co. Pte. Ltd..
    15. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    16. Bernard Caillaud & Jacques Robert, 2005. "Implementation of the revenue-maximizing auction by an ignorant seller," Review of Economic Design, Springer;Society for Economic Design, vol. 9(2), pages 127-143, April.
    17. Schweizer, Nikolaus & Szech, Nora, 2015. "The quantitative view of Myerson regularity," Discussion Papers, Research Unit: Economics of Change SP II 2015-307, WZB Berlin Social Science Center.
    18. Zizhuo Wang & Shiming Deng & Yinyu Ye, 2014. "Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems," Operations Research, INFORMS, vol. 62(2), pages 318-331, April.
    19. Dhangwatnotai, Peerapong & Roughgarden, Tim & Yan, Qiqi, 2015. "Revenue maximization with a single sample," Games and Economic Behavior, Elsevier, vol. 91(C), pages 318-333.
    20. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    21. Omar Besbes & Assaf Zeevi, 2009. "Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms," Operations Research, INFORMS, vol. 57(6), pages 1407-1420, December.
    22. Alessandro Chiesa & Silvio Micali & Zeyuan Allen Zhu, 2015. "Knightian Analysis of the Vickrey Mechanism," Econometrica, Econometric Society, vol. 83(5), pages 1727-1754, September.
    23. Gabriel Carroll, 2019. "Robustness in Mechanism Design and Contracting," Annual Review of Economics, Annual Reviews, vol. 11(1), pages 139-166, August.
    24. Bergemann & Morris, . "An Introduction to Robust Mechanism Design," Foundations and Trends(R) in Microeconomics, now publishers, vol. 8(3), pages 169-230.
    25. Levin, Dan & Ozdenoren, Emre, 2004. "Auctions with uncertain numbers of bidders," Journal of Economic Theory, Elsevier, vol. 118(2), pages 229-251, October.
    26. Harstad, Ronald M. & Kagel, John H. & Levin, Dan, 1990. "Equilibrium bid functions for auctions with an uncertain number of bidders," Economics Letters, Elsevier, vol. 33(1), pages 35-40, May.
    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. Gretschko, Vitali & Mass, Helene, 2024. "Worst-case equilibria in first-price auctions," Theoretical Economics, Econometric Society, vol. 19(1), January.
    2. Dirk Bergemann & Tan Gan & Yingkai Li, 2023. "Managing Persuasion Robustly: The Optimality of Quota Rules," Papers 2310.10024, arXiv.org.
    3. Han, Jun & Weber, Thomas A., 2023. "Price discrimination with robust beliefs," European Journal of Operational Research, Elsevier, vol. 306(2), pages 795-809.
    4. Renato Paes Leme & Balasubramanian Sivan & Yifeng Teng & Pratik Worah, 2023. "Description Complexity of Regular Distributions," Papers 2305.05590, arXiv.org.
    5. Shixin Wang, 2023. "The Power of Simple Menus in Robust Selling Mechanisms," Papers 2310.17392, arXiv.org, revised Sep 2024.
    6. Shixin Wang, 2024. "Semi-Separable Mechanisms in Multi-Item Robust Screening," Papers 2408.13580, arXiv.org.
    7. Yeganeh Alimohammadi & Aranyak Mehta & Andres Perlroth, 2023. "Incentive Compatibility in the Auto-bidding World," Papers 2301.13414, arXiv.org, revised May 2024.
    8. Pieter Kleer & Johan van Leeuwaarden, 2022. "Optimal Stopping Theory for a Distributionally Robust Seller," Papers 2206.02477, arXiv.org, revised Jun 2022.

    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. Çağıl Koçyiğit & Garud Iyengar & Daniel Kuhn & Wolfram Wiesemann, 2020. "Distributionally Robust Mechanism Design," Management Science, INFORMS, vol. 66(1), pages 159-189, January.
    2. Jerry Anunrojwong & Santiago R. Balseiro & Omar Besbes, 2022. "On the Robustness of Second-Price Auctions in Prior-Independent Mechanism Design," Papers 2204.10478, arXiv.org, revised Jan 2024.
    3. 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.
    4. He, Wei & Li, Jiangtao, 2022. "Correlation-robust auction design," Journal of Economic Theory, Elsevier, vol. 200(C).
    5. Suzdaltsev, Alex, 2022. "Distributionally robust pricing in independent private value auctions," Journal of Economic Theory, Elsevier, vol. 206(C).
    6. Jerry Anunrojwong & Santiago R. Balseiro & Omar Besbes, 2023. "Robust Auction Design with Support Information," Papers 2305.09065, arXiv.org, revised Aug 2023.
    7. Athanassios N. Avramidis & Arnoud V. Boer, 2021. "Dynamic pricing with finite price sets: a non-parametric approach," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(1), pages 1-34, August.
    8. Athanassios N. Avramidis, 2020. "A pricing problem with unknown arrival rate and price sensitivity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(1), pages 77-106, August.
    9. Vasserman, Shoshana & Watt, Mitchell, 2021. "Risk aversion and auction design: Theoretical and empirical evidence," International Journal of Industrial Organization, Elsevier, vol. 79(C).
    10. Ghate, Archis, 2015. "Optimal minimum bids and inventory scrapping in sequential, single-unit, Vickrey auctions with demand learning," European Journal of Operational Research, Elsevier, vol. 245(2), pages 555-570.
    11. N. Bora Keskin & Assaf Zeevi, 2017. "Chasing Demand: Learning and Earning in a Changing Environment," Mathematics of Operations Research, INFORMS, vol. 42(2), pages 277-307, May.
    12. Carrasco, Vinicius & Farinha Luz, Vitor & Kos, Nenad & Messner, Matthias & Monteiro, Paulo & Moreira, Humberto, 2018. "Optimal selling mechanisms under moment conditions," Journal of Economic Theory, Elsevier, vol. 177(C), pages 245-279.
    13. Shixin Wang, 2023. "The Power of Simple Menus in Robust Selling Mechanisms," Papers 2310.17392, arXiv.org, revised Sep 2024.
    14. Sentao Miao & Xi Chen & Xiuli Chao & Jiaxi Liu & Yidong Zhang, 2022. "Context‐based dynamic pricing with online clustering," Production and Operations Management, Production and Operations Management Society, vol. 31(9), pages 3559-3575, September.
    15. Wanchang Zhang, 2021. "Random Double Auction: A Robust Bilateral Trading Mechanism," Papers 2105.05427, arXiv.org, revised May 2022.
    16. Mustafa Ç. Pınar, 2018. "Robust trading mechanisms over 0/1 polytopes," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 845-860, October.
    17. Diego Aycinena & Lucas Rentschler, 2018. "Auctions with endogenous participation and an uncertain number of bidders: experimental evidence," Experimental Economics, Springer;Economic Science Association, vol. 21(4), pages 924-949, December.
    18. Sosung Baik & Sung-Ha Hwang, 2021. "Auction design with ambiguity: Optimality of the first-price and all-pay auctions," Papers 2110.08563, arXiv.org.
    19. Song, Yangwei, 2018. "Efficient Implementation with Interdependent Valuations and Maxmin Agents," Rationality and Competition Discussion Paper Series 92, CRC TRR 190 Rationality and Competition.
    20. Boxiao Chen & Xiuli Chao & Cong Shi, 2021. "Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 726-756, May.

    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:inm:ormnsc:v:66:y:2020:i:10:p:4417-4432. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.