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

Entry and disclosure in group contests

Author

Listed:
  • Luke Boosey
  • Philip Brookins
  • Dmitry Ryvkin

Abstract

We study information disclosure policies for contests among groups. Each player endogenously decides whether or not to participate in competition as a member of their group. Within-group aggregation of effort is best-shot, i.e., each group's performance is determined by the highest investment among its members. We consider a generalized all-pay auction setting, in which the group with the highest performance wins the contest with certainty. Players' values for winning are private information at the entry stage, but may be disclosed at the competition stage. We compare three disclosure policies: (i) no disclosure, when the number of entrants remains unknown and their values private; (ii) within-group disclosure, when this information is disclosed within each group but not across groups; and (iii) full disclosure, when the information about entrants is disclosed across groups. For the benchmark case of contests between individuals, information disclosure always reduces expected aggregate investment. However, this is no longer true in group contests: Within-group disclosure unambiguously raises aggregate investment, while the effect of full disclosure is ambiguous.

Suggested Citation

  • Luke Boosey & Philip Brookins & Dmitry Ryvkin, 2025. "Entry and disclosure in group contests," Papers 2503.20092, arXiv.org.
    • Handle: RePEc:arx:papers:2503.20092
    as

    Download full text from publisher

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

    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. Mark Isaac & Svetlana Pevnitskaya & Kurt S. Schnier, 2012. "Individual Behavior And Bidding Heterogeneity In Sealed Bid Auctions Where The Number Of Bidders Is Unknown," Economic Inquiry, Western Economic Association International, vol. 50(2), pages 516-533, April.
    3. Eliaz, Kfir & Wu, Qinggong, 2018. "A simple model of competition between teams," Journal of Economic Theory, Elsevier, vol. 176(C), pages 372-392.
    4. Kahana, Nava & Klunover, Doron, 2016. "Complete rent dissipation when the number of rent seekers is uncertain," Economics Letters, Elsevier, vol. 141(C), pages 8-10.
    5. Barbieri, Stefano & Kovenock, Dan & Malueg, David A. & Topolyan, Iryna, 2019. "Group contests with private information and the “Weakest Link”," Games and Economic Behavior, Elsevier, vol. 118(C), pages 382-411.
    6. Ron Siegel, 2009. "All-Pay Contests," Econometrica, Econometric Society, vol. 77(1), pages 71-92, January.
    7. 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.
    8. Krishna, Vijay & Morgan, John, 1997. "An Analysis of the War of Attrition and the All-Pay Auction," Journal of Economic Theory, Elsevier, vol. 72(2), pages 343-362, February.
    9. Douglas Dyer & John H. Kagel & Dan Levin, 1989. "Resolving Uncertainty about the Number of Bidders in Independent Private-Value Auctions: An Experimental Analysis," RAND Journal of Economics, The RAND Corporation, vol. 20(2), pages 268-279, Summer.
    10. Levin, Dan & Ozdenoren, Emre, 2004. "Auctions with uncertain numbers of bidders," Journal of Economic Theory, Elsevier, vol. 118(2), pages 229-251, October.
    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. Luke Boosey & Philip Brookins & Dmitry Ryvkin, 2020. "Entry in group contests," Working Papers wp2020_02_01, Department of Economics, Florida State University.
    2. Luke Boosey & Philip Brookins & Dmitry Ryvkin, 2020. "Information Disclosure in Contests with Endogenous Entry: An Experiment," Management Science, INFORMS, vol. 66(11), pages 5128-5150, November.
    3. Boosey, Luke & Brookins, Philip & Ryvkin, Dmitry, 2017. "Contests with group size uncertainty: Experimental evidence," Games and Economic Behavior, Elsevier, vol. 105(C), pages 212-229.
    4. Joy Buchanan & Steven Gjerstad & David Porter, 2016. "Information Effects in Uniform Price Multi‐Unit Dutch Auctions," Southern Economic Journal, John Wiley & Sons, vol. 83(1), pages 126-145, July.
    5. Mikhail Drugov & Dmitry Ryvkin, 2019. "The shape of luck and competition in tournaments," Working Papers w0251, Center for Economic and Financial Research (CEFIR).
    6. Yunmi Kong, 2020. "Not knowing the competition: evidence and implications for auction design," RAND Journal of Economics, RAND Corporation, vol. 51(3), pages 840-867, September.
    7. Jiao, Qian & Ke, Changxia & Liu, Yang, 2022. "When to disclose the number of contestants: Theory and experimental evidence," Journal of Economic Behavior & Organization, Elsevier, vol. 193(C), pages 146-160.
    8. Ryvkin, Dmitry & Drugov, Mikhail, 2020. "The shape of luck and competition in winner-take-all tournaments," Theoretical Economics, Econometric Society, vol. 15(4), November.
    9. 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.
    10. Kim, Bara & Yoo, Seung Han, 2021. "Population uncertainty and revealing contestants," Economics Letters, Elsevier, vol. 199(C).
    11. Mark Isaac & Svetlana Pevnitskaya & Kurt S. Schnier, 2012. "Individual Behavior And Bidding Heterogeneity In Sealed Bid Auctions Where The Number Of Bidders Is Unknown," Economic Inquiry, Western Economic Association International, vol. 50(2), pages 516-533, April.
    12. Dmitry Ryvkin & Mikhail Drugov, 2017. "Tournaments," Working Papers wp2017_03_02, Department of Economics, Florida State University.
    13. Kashyap, Ravi, 2018. "Auction theory adaptations for real life applications," Research in Economics, Elsevier, vol. 72(4), pages 452-481.
    14. Drugov, Mikhail & Ryvkin, Dmitry, 2017. "Winner-Take-All Tournaments," CEPR Discussion Papers 12067, C.E.P.R. Discussion Papers.
    15. Chen, Bo & Jiang, Xiandeng & Knyazev, Dmitriy, 2017. "On disclosure policies in all-pay auctions with stochastic entry," Journal of Mathematical Economics, Elsevier, vol. 70(C), pages 66-73.
    16. Boosey, Luke & Brookins, Philip & Ryvkin, Dmitry, 2019. "Contests between groups of unknown size," Games and Economic Behavior, Elsevier, vol. 113(C), pages 756-769.
    17. Vleugels, Jan, 1997. "Bidding against an unknown number of competitors sharing affiliated information," Papers 97-13, Sonderforschungsbreich 504.
    18. Li, Zhen & Yue, Jinfeng & Kuo, Ching-Chung, 2018. "Design of discrete Dutch auctions with consideration of time," European Journal of Operational Research, Elsevier, vol. 265(3), pages 1159-1171.
    19. Ravi Kashyap, 2018. "Auction Theory Adaptations for Real Life Applications," Papers 1810.01736, arXiv.org, revised May 2019.
    20. Pierre Bernhard & Marc Deschamps, 2017. "On Dynamic Games with Randomly Arriving Players," Dynamic Games and Applications, Springer, vol. 7(3), pages 360-385, September.

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