IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2408.12001.html
   My bibliography  Save this paper

Rank-Guaranteed Auctions

Author

Listed:
  • Wei He
  • Jiangtao Li
  • Weijie Zhong

Abstract

We propose a combinatorial ascending auction that is "approximately" optimal, requiring minimal rationality to achieve this level of optimality, and is robust to strategic and distributional uncertainties. Specifically, the auction is rank-guaranteed, meaning that for any menu M and any valuation profile, the ex-post revenue is guaranteed to be at least as high as the highest revenue achievable from feasible allocations, taking the (|M|+ 1)th-highest valuation for each bundle as the price. Our analysis highlights a crucial aspect of combinatorial auction design, namely, the design of menus. We provide simple and approximately optimal menus in various settings.

Suggested Citation

  • Wei He & Jiangtao Li & Weijie Zhong, 2024. "Rank-Guaranteed Auctions," Papers 2408.12001, arXiv.org.
    • Handle: RePEc:arx:papers:2408.12001
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2408.12001
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Cramton, Peter & Schwartz, Jesse A, 2000. "Collusive Bidding: Lessons from the FCC Spectrum Auctions," Journal of Regulatory Economics, Springer, vol. 17(3), pages 229-252, May.
    3. Jehiel, Philippe & Moldovanu, Benny, 2001. "Efficient Design with Interdependent Valuations," Econometrica, Econometric Society, vol. 69(5), pages 1237-1259, September.
    4. Paul Milgrom, 2000. "Putting Auction Theory to Work: The Simultaneous Ascending Auction," Journal of Political Economy, University of Chicago Press, vol. 108(2), pages 245-272, April.
    5. Bulow, Jeremy & Klemperer, Paul, 1996. "Auctions versus Negotiations," American Economic Review, American Economic Association, vol. 86(1), pages 180-194, March.
    6. Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2007. "Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords," American Economic Review, American Economic Association, vol. 97(1), pages 242-259, March.
    7. Paul Klemperer, 2002. "What Really Matters in Auction Design," Journal of Economic Perspectives, American Economic Association, vol. 16(1), pages 169-189, Winter.
    8. Dirk Bergemann & Stephen Morris, 2012. "Robust Mechanism Design," World Scientific Book Chapters, in: Robust Mechanism Design The Role of Private Information and Higher Order Beliefs, chapter 2, pages 49-96, World Scientific Publishing Co. Pte. Ltd..
    9. Songzi Du, 2018. "Robust Mechanisms Under Common Valuation," Econometrica, Econometric Society, vol. 86(5), pages 1569-1588, September.
    10. Suzdaltsev, Alex, 2022. "Distributionally robust pricing in independent private value auctions," Journal of Economic Theory, Elsevier, vol. 206(C).
    11. Matthew O. Jackson, 1992. "Implementation in Undominated Strategies: A Look at Bounded Mechanisms," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 59(4), pages 757-775.
    12. Jehiel, Phillipe & Moldovanu, Benny, 2001. "The European UMTS/IMT-2000 License Auctions," Sonderforschungsbereich 504 Publications 01-20, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
    13. Ausubel Lawrence M & Milgrom Paul R, 2002. "Ascending Auctions with Package Bidding," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 1(1), pages 1-44, August.
    14. Shengwu Li, 2017. "Obviously Strategy-Proof Mechanisms," American Economic Review, American Economic Association, vol. 107(11), pages 3257-3287, November.
    15. Chen, Yi-Chun & Li, Jiangtao, 2018. "Revisiting the foundations of dominant-strategy mechanisms," Journal of Economic Theory, Elsevier, vol. 178(C), pages 294-317.
    16. Gabriel Carroll, 2017. "Robustness and Separation in Multidimensional Screening," Econometrica, Econometric Society, vol. 85, pages 453-488, March.
    17. Michael H. Rothkopf & Aleksandar Pekev{c} & Ronald M. Harstad, 1998. "Computationally Manageable Combinational Auctions," Management Science, INFORMS, vol. 44(8), pages 1131-1147, August.
    18. Takuro Yamashita & Shuguang Zhu, 2022. "On the Foundations of Ex Post Incentive-Compatible Mechanisms," American Economic Journal: Microeconomics, American Economic Association, vol. 14(4), pages 494-514, November.
    19. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    20. Benjamin Brooks & Songzi Du, 2021. "Optimal Auction Design With Common Values: An Informationally Robust Approach," Econometrica, Econometric Society, vol. 89(3), pages 1313-1360, May.
    21. Jonathan Levin & Andrzej Skrzypacz, 2016. "Properties of the Combinatorial Clock Auction," American Economic Review, American Economic Association, vol. 106(9), pages 2528-2551, September.
    22. He, Wei & Li, Jiangtao, 2022. "Correlation-robust auction design," Journal of Economic Theory, Elsevier, vol. 200(C).
    Full references (including those not matched with items on IDEAS)

    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. Wanchang Zhang, 2022. "Robust Private Supply of a Public Good," Papers 2201.00923, arXiv.org, revised Jan 2022.
    2. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    3. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    4. Wanchang Zhang, 2022. "Auctioning Multiple Goods without Priors," Papers 2204.13726, arXiv.org.
    5. He, Wei & Li, Jiangtao, 2022. "Correlation-robust auction design," Journal of Economic Theory, Elsevier, vol. 200(C).
    6. Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
    7. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Strategy-proof multi-object mechanism design: Ex-post revenue maximization with non-quasilinear preferences," Journal of Economic Theory, Elsevier, vol. 188(C).
    8. Satoshi Nakada & Shmuel Nitzan & Takashi Ui, 2022. "Robust Voting under Uncertainty," Working Papers on Central Bank Communication 038, University of Tokyo, Graduate School of Economics.
    9. Wanchang Zhang, 2021. "Random Double Auction: A Robust Bilateral Trading Mechanism," Papers 2105.05427, arXiv.org, revised May 2022.
    10. Mukherjee, Saptarshi & Muto, Nozomu & Sen, Arunava, 2024. "Implementation in undominated strategies with applications to auction design, public good provision and matching," Journal of Economic Theory, Elsevier, vol. 216(C).
    11. Pham, Hien & Yamashita, Takuro, 2024. "Auction design with heterogeneous priors," Games and Economic Behavior, Elsevier, vol. 145(C), pages 413-425.
    12. Tang, Rui & Zhang, Mu, 2021. "Maxmin implementation," Journal of Economic Theory, Elsevier, vol. 194(C).
    13. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    14. Caleb Koch, 2020. "Implementation with ex post hidden actions," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 5(1), pages 1-35, December.
    15. Jiangtao Li & Piotr Dworczak, 2020. "Are simple mechanisms optimal when agents are unsophisticated?," GRAPE Working Papers 42, GRAPE Group for Research in Applied Economics.
    16. van Damme, E.E.C. & Börgers, T., 2003. "Auction Theory for Auction Design," Other publications TiSEM b04d61c2-a33b-4df4-b39b-0, Tilburg University, School of Economics and Management.
    17. Loertscher, Simon & Marx, Leslie M., 2020. "Asymptotically optimal prior-free clock auctions," Journal of Economic Theory, Elsevier, vol. 187(C).
    18. Ignacio Palacios-Huerta & David C. Parkes & Richard Steinberg, 2024. "Combinatorial Auctions in Practice," Journal of Economic Literature, American Economic Association, vol. 62(2), pages 517-553, June.
    19. Kevin Leyton-Brown & Paul Milgrom & Neil Newman & Ilya Segal, 2023. "Artificial Intelligence and Market Design: Lessons Learned from Radio Spectrum Reallocation," NBER Chapters, in: New Directions in Market Design, National Bureau of Economic Research, Inc.
    20. Anthony M. Kwasnica & John O. Ledyard & Dave Porter & Christine DeMartini, 2005. "A New and Improved Design for Multiobject Iterative Auctions," Management Science, INFORMS, vol. 51(3), pages 419-434, March.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:arx:papers:2408.12001. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.