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

Correlation-Robust Optimal Auctions

Author

Listed:
  • Wanchang Zhang

Abstract

I study the design of auctions in which the auctioneer is assumed to have information only about the marginal distribution of a generic bidder's valuation, but does not know the correlation structure of the joint distribution of bidders' valuations. I assume that a generic bidder's valuation is bounded and $\bar{v}$ is the maximum valuation of a generic bidder. The performance of a mechanism is evaluated in the worst case over the uncertainty of joint distributions that are consistent with the marginal distribution. For the two-bidder case, the second-price auction with the uniformly distributed random reserve maximizes the worst-case expected revenue across all dominant-strategy mechanisms under certain regularity conditions. For the $N$-bidder ($N\ge3$) case, the second-price auction with the $\bar{v}-$scaled $Beta (\frac{1}{N-1},1)$ distributed random reserve maximizes the worst-case expected revenue across standard (a bidder whose bid is not the highest will never be allocated) dominant-strategy mechanisms under certain regularity conditions. When the probability mass condition (part of the regularity conditions) does not hold, the second-price auction with the $s^*-$scaled $Beta (\frac{1}{N-1},1)$ distributed random reserve maximizes the worst-case expected revenue across standard dominant-strategy mechanisms, where $s^*\in (0,\bar{v})$.

Suggested Citation

  • Wanchang Zhang, 2021. "Correlation-Robust Optimal Auctions," Papers 2105.04697, arXiv.org, revised May 2022.
  • Handle: RePEc:arx:papers:2105.04697
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Carroll, Gabriel & Meng, Delong, 2016. "Robust contracting with additive noise," Journal of Economic Theory, Elsevier, vol. 166(C), pages 586-604.
    2. Dirk Bergemann & Stephen Morris, 2013. "Robust Predictions in Games With Incomplete Information," Econometrica, Econometric Society, vol. 81(4), pages 1251-1308, July.
    3. Ç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.
    4. Dirk Bergemann & Benjamin Brooks & Stephen Morris, 2016. "Informationally Robust Optimal Auction Design," Working Papers 084_2016, Princeton University, Department of Economics, Econometric Research Program..
    5. 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..
    6. Songzi Du, 2018. "Robust Mechanisms Under Common Valuation," Econometrica, Econometric Society, vol. 86(5), pages 1569-1588, September.
    7. Dirk Bergemann & Karl Schlag, 2012. "Robust Monopoly Pricing," World Scientific Book Chapters, in: Robust Mechanism Design The Role of Private Information and Higher Order Beliefs, chapter 13, pages 417-441, World Scientific Publishing Co. Pte. Ltd..
    8. Condorelli, Daniele & Szentes, Balázs, 2020. "Information design in the holdup problem," LSE Research Online Documents on Economics 90620, London School of Economics and Political Science, LSE Library.
    9. Gabriel Carroll, 2017. "Robustness and Separation in Multidimensional Screening," Econometrica, Econometric Society, vol. 85, pages 453-488, March.
    10. repec:cwl:cwldpp:1821rrr is not listed on IDEAS
    11. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    12. Ethan Che, 2019. "Distributionally Robust Optimal Auction Design under Mean Constraints," Papers 1911.07103, arXiv.org, revised Feb 2022.
    13. Garrett, Daniel F., 2014. "Robustness of simple menus of contracts in cost-based procurement," Games and Economic Behavior, Elsevier, vol. 87(C), pages 631-641.
    14. Daniele Condorelli & Balázs Szentes, 2020. "Information Design in the Holdup Problem," Journal of Political Economy, University of Chicago Press, vol. 128(2), pages 681-709.
    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. Wanchang Zhang, 2022. "Robust Private Supply of a Public Good," Papers 2201.00923, arXiv.org, revised Jan 2022.
    2. Wanchang Zhang, 2021. "Random Double Auction: A Robust Bilateral Trading Mechanism," Papers 2105.05427, arXiv.org, revised May 2022.
    3. He, Wei & Li, Jiangtao, 2022. "Correlation-robust auction design," Journal of Economic Theory, Elsevier, vol. 200(C).

    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. Wanchang Zhang, 2021. "Random Double Auction: A Robust Bilateral Trading Mechanism," Papers 2105.05427, arXiv.org, revised May 2022.
    3. Wanchang Zhang, 2022. "Auctioning Multiple Goods without Priors," Papers 2204.13726, arXiv.org.
    4. He, Wei & Li, Jiangtao, 2022. "Correlation-robust auction design," Journal of Economic Theory, Elsevier, vol. 200(C).
    5. Yeon-Koo Che & Weijie Zhong, 2021. "Robustly Optimal Mechanisms for Selling Multiple Goods," Papers 2105.02828, arXiv.org, revised Aug 2024.
    6. NAKADA, Satoshi & NITZAN, Shmuel & UI, Takashi & 宇井, 貴志, 2017. "Robust Voting under Uncertainty," Discussion paper series HIAS-E-60, Hitotsubashi Institute for Advanced Study, Hitotsubashi University.
    7. Wanchang Zhang, 2022. "Information-Robust Optimal Auctions," Papers 2205.04137, arXiv.org.
    8. Wei He & Jiangtao Li & Weijie Zhong, 2024. "Rank-Guaranteed Auctions," Papers 2408.12001, arXiv.org.
    9. Ethan Che, 2019. "Distributionally Robust Optimal Auction Design under Mean Constraints," Papers 1911.07103, arXiv.org, revised Feb 2022.
    10. Vinicius Carrasco & Vitor Farinha Luz & Paulo K. Monteiro & Humberto Moreira, 2019. "Robust mechanisms: the curvature case," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 68(1), pages 203-222, July.
    11. Shixin Wang, 2024. "Semi-Separable Mechanisms in Multi-Item Robust Screening," Papers 2408.13580, arXiv.org.
    12. Zhaolin Li & Samuel N. Kirshner, 2021. "Salesforce Compensation and Two‐Sided Ambiguity: Robust Moral Hazard with Moment Information," Production and Operations Management, Production and Operations Management Society, vol. 30(9), pages 2944-2961, September.
    13. Ju Hu & Xi Weng, 2021. "Robust persuasion of a privately informed receiver," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 72(3), pages 909-953, October.
    14. Shixin Wang, 2023. "The Power of Simple Menus in Robust Selling Mechanisms," Papers 2310.17392, arXiv.org, revised Sep 2024.
    15. Chen, Yi-Chun & Yang, Xiangqian, 2023. "Information design in optimal auctions," Journal of Economic Theory, Elsevier, vol. 212(C).
    16. Suzdaltsev, Alex, 2022. "Distributionally robust pricing in independent private value auctions," Journal of Economic Theory, Elsevier, vol. 206(C).
    17. Pham, Hien & Yamashita, Takuro, 2024. "Auction design with heterogeneous priors," Games and Economic Behavior, Elsevier, vol. 145(C), pages 413-425.
    18. Garrett, Daniel F., 2020. "Payoff Implications of Incentive Contracting," TSE Working Papers 20-1140, Toulouse School of Economics (TSE).
    19. Carroll, Gabriel, 2016. "Informationally robust trade and limits to contagion," Journal of Economic Theory, Elsevier, vol. 166(C), pages 334-361.
    20. Garrett, Daniel F. & Georgiadis, George & Smolin, Alex & Szentes, Balázs, 2023. "Optimal technology design," Journal of Economic Theory, Elsevier, vol. 209(C).

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