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

Optimal disclosure in all-pay auctions with interdependent valuations

Author

Listed:
  • Chen, Bo
  • Chen, Bo

Abstract

We study all-pay auctions with one-sided private information and interdependent valuations. To sharpen the competition and maximize revenue, the auction organizer can design an information disclosure policy through Bayesian persuasion about the bidder with private information. We characterize optimal disclosure and find that optimal disclosure exhibits almost full disclosure, where the uninformed bidder can always narrow the informed bidder's private information down to at most two types. We also illustrate our characterization in a simple binary-type setting and investigate issues such as comparative statics, welfare, and efficiency.

Suggested Citation

  • Chen, Bo & Chen, Bo, 2024. "Optimal disclosure in all-pay auctions with interdependent valuations," Games and Economic Behavior, Elsevier, vol. 143(C), pages 204-222.
    • Handle: RePEc:eee:gamebe:v:143:y:2024:i:c:p:204-222
    DOI: 10.1016/j.geb.2023.11.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825623001835
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2023.11.010?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. Jun Zhang & Junjie Zhou, 2016. "Information Disclosure in Contests: A Bayesian Persuasion Approach," Economic Journal, Royal Economic Society, vol. 126(597), pages 2197-2217, November.
    2. Emir Kamenica & Matthew Gentzkow, 2011. "Bayesian Persuasion," American Economic Review, American Economic Association, vol. 101(6), pages 2590-2615, October.
    3. Michael R. Baye & Dan Kovenock & Casper G. Vries, 2008. "Rigging the lobbying process: An application of the all-pay auction," Springer Books, in: Roger D. Congleton & Kai A. Konrad & Arye L. Hillman (ed.), 40 Years of Research on Rent Seeking 2, pages 331-336, Springer.
    4. Jehiel, Philippe & Moldovanu, Benny, 2001. "Efficient Design with Interdependent Valuations," Econometrica, Econometric Society, vol. 69(5), pages 1237-1259, September.
    5. Siegel, Ron, 2014. "Asymmetric all-pay auctions with interdependent valuations," Journal of Economic Theory, Elsevier, vol. 153(C), pages 684-702.
    6. Jingfeng Lu & Hongkun Ma & Zhe Wang, 2018. "Ranking Disclosure Policies In All‐Pay Auctions," Economic Inquiry, Western Economic Association International, vol. 56(3), pages 1464-1485, July.
    7. Jun Zhang & Junjie Zhou, 2016. "Information Disclosure in Contests: A Bayesian Persuasion Approach," Economic Journal, Royal Economic Society, vol. 126(597), pages 2197-2217.
    8. Milgrom, Paul & Weber, Robert J., 1982. "The value of information in a sealed-bid auction," Journal of Mathematical Economics, Elsevier, vol. 10(1), pages 105-114, June.
    9. Fu, Qiang & Jiao, Qian & Lu, Jingfeng, 2014. "Disclosure policy in a multi-prize all-pay auction with stochastic abilities," Economics Letters, Elsevier, vol. 125(3), pages 376-380.
    10. Florian Morath & Johannes Münster, 2013. "Information acquisition in conflicts," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 54(1), pages 99-129, September.
    11. Morath, Florian & Münster, Johannes, 2008. "Private versus complete information in auctions," Economics Letters, Elsevier, vol. 101(3), pages 214-216, December.
    12. Anton Kolotilin & Roberto Corrao & Alexander Wolitzky, 2022. "Persuasion with Non-Linear Preferences," Papers 2206.09164, arXiv.org, revised Aug 2022.
    13. René Kirkegaard, 2012. "A Mechanism Design Approach to Ranking Asymmetric Auctions," Econometrica, Econometric Society, vol. 80(5), pages 2349-2364, September.
    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. Chen, Bo & Serena, Marco & Wang, Zijia, 2024. "Disclosure policies in all-pay auctions with affiliated values," Economic Modelling, Elsevier, vol. 141(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. Jingfeng Lu & Hongkun Ma & Zhe Wang, 2018. "Ranking Disclosure Policies In All‐Pay Auctions," Economic Inquiry, Western Economic Association International, vol. 56(3), pages 1464-1485, July.
    2. Chen, Bo & Serena, Marco & Wang, Zijia, 2024. "Disclosure policies in all-pay auctions with affiliated values," Economic Modelling, Elsevier, vol. 141(C).
    3. Lu, Jingfeng & Ma, Hongkun & Wang, Zhewei, 2023. "Information sharing decisions in all-pay auctions with correlated types," Journal of Mathematical Economics, Elsevier, vol. 107(C).
    4. Chen, Zhuoqiong, 2021. "Optimal information exchange in contests," Journal of Mathematical Economics, Elsevier, vol. 96(C).
    5. Chen, Bo & Serena, Marco, 2023. "Disclosure Policies in All-Pay Auctions with Bid Caps," Journal of Economic Behavior & Organization, Elsevier, vol. 209(C), pages 141-160.
    6. Chen, Bo, 2020. "Disclosure policies in research contests with stochastic entry," Economics Letters, Elsevier, vol. 191(C).
    7. Zhuoqiong Chen, 2021. "All-pay auctions with private signals about opponents’ values," Review of Economic Design, Springer;Society for Economic Design, vol. 25(1), pages 33-64, June.
    8. Xin Feng, 2023. "Information disclosure in all-pay contests with costly entry," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(2), pages 401-421, June.
    9. Chen, Bo & Ma, Lijun & Zhu, Zhaobo & Zhou, Yu, 2020. "Disclosure policies in all-pay auctions with bid caps and stochastic entry," Economics Letters, Elsevier, vol. 186(C).
    10. Marco Serena, 2017. "Harnessing Beliefs to Stimulate Efforts; on the Optimal Disclosure Policy in Contests," Working Papers tax-mpg-rps-2018-11, Max Planck Institute for Tax Law and Public Finance.
    11. Feng, Xin, 2024. "Ambiguous persuasion in contests," Journal of Economic Behavior & Organization, Elsevier, vol. 220(C), pages 182-201.
    12. Feng, Xin, 2020. "Information disclosure on the contest mechanism," Journal of Mathematical Economics, Elsevier, vol. 91(C), pages 148-156.
    13. Sharma, Priyanka & Wagman, Liad, 2020. "Advertising and Voter Data in Asymmetric Political Contests," Information Economics and Policy, Elsevier, vol. 52(C).
    14. Marco Serena, 2022. "Harnessing beliefs to optimally disclose contestants’ types," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 74(3), pages 763-792, October.
    15. Chen, Yanlin & Hu, Audrey & Zhang, Jun, 2024. "Optimal auction design with aftermarket Cournot competition," Games and Economic Behavior, Elsevier, vol. 145(C), pages 54-65.
    16. Balzer, Benjamin & Schneider, Johannes, 2021. "Persuading to participate: Coordination on a standard," International Journal of Industrial Organization, Elsevier, vol. 78(C).
    17. Clark, Derek J. & Kundu, Tapas, 2021. "Competitive balance: Information disclosure and discrimination in an asymmetric contest," Journal of Economic Behavior & Organization, Elsevier, vol. 184(C), pages 178-198.
    18. Shanglyu Deng & Hanming Fang & Qiang Fu & Zenan Wu, 2023. "Information Favoritism and Scoring Bias in Contests," PIER Working Paper Archive 23-002, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    19. Shanglyu Deng & Hanming Fang & Qiang Fu & Zenan Wu, 2020. "Confidence Management in Tournaments," NBER Working Papers 27186, National Bureau of Economic Research, Inc.
    20. Ford, Weixing & Lian, Zeng & Lien, Jaimie W. & Zheng, Jie, 2020. "Information sharing in a contest game with group identity," Economics Letters, Elsevier, vol. 189(C).

    More about this item

    Keywords

    All-pay auction; Contest; Bayesian persuasion; Information disclosure; Interdependent valuations;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    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:143:y:2024:i:c:p:204-222. 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.