IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2608.22694.html

Outcome Disclosure and Temporal Refinement in Multi-Battle Team Contests

Author

Listed:
  • Bo Chen
  • Rui Gao
  • Jingfeng Lu
  • Zhewei Wang

Abstract

A team-contest designer values output rather than expenditure; nonlinear conversion makes the distinction consequential. We study two non-pecuniary instruments in majority-rule contests decided by pairwise all-pay battles with private abilities: disclosing resolved outcomes and splitting the battle schedule into finer blocks. Neither changes a battle's average pivotality; each only redistributes it across histories. Under nested information structures, this redistribution makes equilibrium ability-scaled expenditure weakly more dispersed player by player without changing its mean; expected aggregate expenditure is invariant across all designs considered. The resulting convex-order comparison ranks expected total output: convex output costs favor no disclosure and coarser temporal structures, concave costs favor full disclosure and finer ones, and linear costs make both comparisons neutral. The rankings hold for finite-support and smooth continuous-type ability distributions. The mechanism extends to degree-zero component contest technologies with a unique equilibrium outcome distribution. No and full disclosure bound every admissible public garbling.

Suggested Citation

  • Bo Chen & Rui Gao & Jingfeng Lu & Zhewei Wang, 2026. "Outcome Disclosure and Temporal Refinement in Multi-Battle Team Contests," Papers 2608.22694, arXiv.org.
  • Handle: RePEc:arx:papers:2608.22694
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2608.22694
    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:2608.22694. 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: https://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.