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

Algorithmic Information Disclosure in Optimal Auctions

Author

Listed:
  • Yang Cai
  • Yingkai Li
  • Jinzhao Wu

Abstract

This paper studies a joint design problem where a seller can design both the signal structures for the agents to learn their values, and the allocation and payment rules for selling the item. In his seminal work, Myerson (1981) shows how to design the optimal auction with exogenous signals. We show that the problem becomes NP-hard when the seller also has the ability to design the signal structures. Our main result is a polynomial-time approximation scheme (PTAS) for computing the optimal joint design with at most an $\epsilon$ multiplicative loss in expected revenue. Moreover, we show that in our joint design problem, the seller can significantly reduce the information rent of the agents by providing partial information, which ensures a revenue that is at least $1 - \frac{1}{e}$ of the optimal welfare for all valuation distributions.

Suggested Citation

  • Yang Cai & Yingkai Li & Jinzhao Wu, 2024. "Algorithmic Information Disclosure in Optimal Auctions," Papers 2403.08145, arXiv.org.
  • Handle: RePEc:arx:papers:2403.08145
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Hao Li & Xianwen Shi, 2017. "Discriminatory Information Disclosure," American Economic Review, American Economic Association, vol. 107(11), pages 3363-3385, November.
    2. Dirk Bergemann & Benjamin Brooks & Stephen Morris, 2015. "The Limits of Price Discrimination," American Economic Review, American Economic Association, vol. 105(3), pages 921-957, March.
    3. Anne-Katrin Roesler & Balázs Szentes, 2017. "Buyer-Optimal Learning and Monopoly Pricing," American Economic Review, American Economic Association, vol. 107(7), pages 2072-2080, July.
    4. Nima Haghpanah & Ron Siegel, 2023. "Pareto-Improving Segmentation of Multiproduct Markets," Journal of Political Economy, University of Chicago Press, vol. 131(6), pages 1546-1575.
    5. Bergemann, Dirk & Pesendorfer, Martin, 2007. "Information structures in optimal auctions," Journal of Economic Theory, Elsevier, vol. 137(1), pages 580-609, November.
    6. Péter Eső & Balázs Szentes, 2007. "Optimal Information Disclosure in Auctions and the Handicap Auction," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 74(3), pages 705-731.
    7. Border, Kim C, 1991. "Implementation of Reduced Form Auctions: A Geometric Approach," Econometrica, Econometric Society, vol. 59(4), pages 1175-1187, July.
    8. Chen, Yi-Chun & Yang, Xiangqian, 2023. "Information design in optimal auctions," Journal of Economic Theory, Elsevier, vol. 212(C).
    9. Luis Rayo & Ilya Segal, 2010. "Optimal Information Disclosure," Journal of Political Economy, University of Chicago Press, vol. 118(5), pages 949-987.
    10. Paulo K. Monteiro & Flavio M. Menezes, 2000. "original papers : Auctions with endogenous participation," Review of Economic Design, Springer;Society for Economic Design, vol. 5(1), pages 71-89.
    11. Dirk Bergemann & Tibor Heumann & Stephen Morris & Constantine Sorokin & Eyal Winter, 2022. "Optimal Information Disclosure in Classic Auctions," American Economic Review: Insights, American Economic Association, vol. 4(3), pages 371-388, September.
    12. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    13. 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.
    14. Cremer, Jacques & McLean, Richard P, 1988. "Full Extraction of the Surplus in Bayesian and Dominant Strategy Auctions," Econometrica, Econometric Society, vol. 56(6), pages 1247-1257, November.
    15. Saeed Alaei & Hu Fu & Nima Haghpanah & Jason Hartline & Azarakhsh Malekian, 2019. "Efficient Computation of Optimal Auctions via Reduced Forms," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 1058-1086, August.
    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. Dirk Bergemann & Tibor Heumann & Stephen Morris, 2022. "Screening with Persuasion," Cowles Foundation Discussion Papers 2338, Cowles Foundation for Research in Economics, Yale University.
    2. Jonas von Wangenheim, 2022. "Optimal Information Design of Online Marketplaces with Return Rights," CRC TR 224 Discussion Paper Series crctr224_2022_352v2, University of Bonn and University of Mannheim, Germany, revised Apr 2024.
    3. Gottardi, Piero & Mezzetti, Claudio, 2024. "Shuttle diplomacy," Journal of Economic Theory, Elsevier, vol. 216(C).
    4. Anja Prummer & Francesco Nava, 2023. "Value Design in Optimal Mechanisms," Economics working papers 2023-05, Department of Economics, Johannes Kepler University Linz, Austria.
    5. Anton Kolotilin & Tymofiy Mylovanov & Andriy Zapechelnyuk & Ming Li, 2017. "Persuasion of a Privately Informed Receiver," Econometrica, Econometric Society, vol. 85(6), pages 1949-1964, November.
    6. von Wangenheim, Jonas, 2017. "Consumer-Optimal Information Design," Rationality and Competition Discussion Paper Series 53, CRC TRR 190 Rationality and Competition.
    7. Dirk Bergemann & Stephen Morris, 2019. "Information Design: A Unified Perspective," Journal of Economic Literature, American Economic Association, vol. 57(1), pages 44-95, March.
    8. Suehyun Kwon, 2018. "Selling Complementary Goods: Information and Products," CESifo Working Paper Series 7394, CESifo.
    9. Pham, Hien, 2023. "How Information Design Shapes Optimal Selling Mechanisms," MPRA Paper 120989, University Library of Munich, Germany, revised 06 Mar 2024.
    10. Anja Prummer, "undated". "Discrimination in Promotion," Working Papers 905, Queen Mary University of London, School of Economics and Finance.
    11. Pycia, Marek & Woodward, Kyle, 2021. "Auctions of Homogeneous Goods: A Case for Pay-as-Bid," CEPR Discussion Papers 15656, C.E.P.R. Discussion Papers.
    12. Yingkai Li, 2021. "Selling Data to an Agent with Endogenous Information," Papers 2103.05788, arXiv.org, revised Aug 2023.
    13. Dirk Bergemann & Alessandro Bonatti & Alex Smolin, 2018. "The Design and Price of Information," American Economic Review, American Economic Association, vol. 108(1), pages 1-48, January.
    14. L. Elisa Celis & Gregory Lewis & Markus Mobius & Hamid Nazerzadeh, 2014. "Buy-It-Now or Take-a-Chance: Price Discrimination Through Randomized Auctions," Management Science, INFORMS, vol. 60(12), pages 2927-2948, December.
    15. Kolotilin, Anton & Li, Hongyi, 2021. "Relational communication," Theoretical Economics, Econometric Society, vol. 16(4), November.
    16. Wanchang Zhang, 2022. "Auctioning Multiple Goods without Priors," Papers 2204.13726, arXiv.org.
    17. Pham, Hien, 2023. "How Information Design Shapes Optimal Selling Mechanisms," MPRA Paper 120364, University Library of Munich, Germany, revised 06 Mar 2024.
    18. Schottmüller, Christoph, 2023. "Optimal information structures in bilateral trade," Theoretical Economics, Econometric Society, vol. 18(1), January.
    19. Vasiliki Skreta, 2011. "On the informed seller problem: optimal information disclosure," Review of Economic Design, Springer;Society for Economic Design, vol. 15(1), pages 1-36, March.
    20. Pham, Hien, 2023. "How Information Design Shapes Optimal Selling Mechanisms," MPRA Paper 120462, University Library of Munich, Germany, revised 17 Mar 2024.

    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:2403.08145. 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.