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
    ---><---

    More about this item

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.