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

    References listed on IDEAS

    as
    1. David A. Malueg & Andrew J. Yates, 2010. "Testing Contest Theory: Evidence from Best-of-Three Tennis Matches," The Review of Economics and Statistics, MIT Press, vol. 92(3), pages 689-692, August.
    2. Qiang Fu & Jingfeng Lu, 2020. "On Equilibrium Player Ordering In Dynamic Team Contests," Economic Inquiry, Western Economic Association International, vol. 58(4), pages 1830-1844, October.
    3. Konishi, Hideo & Pan, Chen-Yu & Simeonov, Dimitar, 2022. "Equilibrium player choices in team contests with multiple pairwise battles," Games and Economic Behavior, Elsevier, vol. 132(C), pages 274-287.
    4. Bo Chen & Marco Serena & Zijia Wang, 2023. "Disclosure Policies in All-pay Auctions with Affiliation," Working Papers tax-mpg-rps-2023-05, Max Planck Institute for Tax Law and Public Finance.
    5. Benny Moldovanu & Aner Sela, 2008. "The Optimal Allocation of Prizes in Contests," Springer Books, in: Roger D. Congleton & Arye L. Hillman & Kai A. Konrad (ed.), 40 Years of Research on Rent Seeking 1, pages 615-631, Springer.
    6. Jun Zhang & Junjie Zhou, 2016. "Information Disclosure in Contests: A Bayesian Persuasion Approach," Economic Journal, Royal Economic Society, vol. 126(597), pages 2197-2217.
    7. 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.
    8. 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.
    9. Stergios Skaperdas, 1996. "Contest success functions (*)," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 7(2), pages 283-290.
    10. 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.
    11. Konrad, Kai A. & Kovenock, Dan, 2009. "Multi-battle contests," Games and Economic Behavior, Elsevier, vol. 66(1), pages 256-274, May.
    12. 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).
    13. Feng, Xin & Jiao, Qian & Kuang, Zhonghong & Lu, Jingfeng, 2024. "Optimal prize design in team contests with pairwise battles," Journal of Economic Theory, Elsevier, vol. 215(C).
    14. Kai A. Konrad & Dan Kovenock, 2010. "Contests With Stochastic Abilities," Economic Inquiry, Western Economic Association International, vol. 48(1), pages 89-103, January.
    15. Michael R. Baye & Dan Kovenock & Casper G. Vries, 1996. "The all-pay auction with complete information," Springer Books, in: Roger D. Congleton & Arye L. Hillman & Kai A. Konrad (ed.), 40 Years of Research on Rent Seeking 1, pages 209-223, Springer.
    16. Strumpf, Koleman S, 2002. "Strategic Competition in Sequential Election Contests," Public Choice, Springer, vol. 111(3-4), pages 377-397, June.
    17. Barbieri, Stefano & Serena, Marco, 2024. "Winner's effort in multi-battle team contests," Games and Economic Behavior, Elsevier, vol. 145(C), pages 526-556.
    18. Klumpp, Tilman & Polborn, Mattias K., 2006. "Primaries and the New Hampshire Effect," Journal of Public Economics, Elsevier, vol. 90(6-7), pages 1073-1114, August.
    19. Qiang Fu & Jingfeng Lu & Yue Pan, 2015. "Team Contests with Multiple Pairwise Battles," American Economic Review, American Economic Association, vol. 105(7), pages 2120-2140, July.
    20. Todd R. Kaplan & David Wettstein, 2006. "Caps on Political Lobbying: Comment," American Economic Review, American Economic Association, vol. 96(4), pages 1351-1354, September.
    21. Amann, Erwin & Leininger, Wolfgang, 1996. "Asymmetric All-Pay Auctions with Incomplete Information: The Two-Player Case," Games and Economic Behavior, Elsevier, vol. 14(1), pages 1-18, May.
    22. 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.
    23. Barbieri, Stefano & Serena, Marco, 2022. "Biasing dynamic contests between ex-ante symmetric players," Games and Economic Behavior, Elsevier, vol. 136(C), pages 1-30.
    24. Siegel, Ron, 2014. "Asymmetric all-pay auctions with interdependent valuations," Journal of Economic Theory, Elsevier, vol. 153(C), pages 684-702.
    25. Feng, Xin & Lu, Jingfeng, 2018. "How to split the pie: Optimal rewards in dynamic multi-battle competitions," Journal of Public Economics, Elsevier, vol. 160(C), pages 82-95.
    26. Marc Möller & Juan Beccuti, 2025. "Fighting for Lemons: The Balancing Effect of Private Information on Incentives in Dynamic Contests," The Economic Journal, Royal Economic Society, vol. 135(669), pages 1641-1676.
    27. Gelder, Alan, 2014. "From Custer to Thermopylae: Last stand behavior in multi-stage contests," Games and Economic Behavior, Elsevier, vol. 87(C), pages 442-466.
    28. 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.
    29. Qiang Fu & Zenan Wu, 2022. "Disclosure and Favoritism in Sequential Elimination Contests," American Economic Journal: Microeconomics, American Economic Association, vol. 14(4), pages 78-121, November.
    30. 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.
    31. Christopher Harris & John Vickers, 1987. "Racing with Uncertainty," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 54(1), pages 1-21.
    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. 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.
    2. Barbieri, Stefano & Serena, Marco, 2024. "Winner's effort in multi-battle team contests," Games and Economic Behavior, Elsevier, vol. 145(C), pages 526-556.
    3. Kimbrough, Erik O. & Laughren, Kevin & Sheremeta, Roman, 2020. "War and conflict in economics: Theories, applications, and recent trends," Journal of Economic Behavior & Organization, Elsevier, vol. 178(C), pages 998-1013.
    4. Subhasish M. Chowdhury & Patricia Esteve‐González & Anwesha Mukherjee, 2023. "Heterogeneity, leveling the playing field, and affirmative action in contests," Southern Economic Journal, John Wiley & Sons, vol. 89(3), pages 924-974, January.
    5. Konrad, Kai A., 2007. "Strategy in contests: an introduction [Strategie in Turnieren – eine Einführung]," Discussion Papers, Research Unit: Market Processes and Governance SP II 2007-01, WZB Berlin Social Science Center.
    6. Barbieri, Stefano & Serena, Marco, 2022. "Biasing dynamic contests between ex-ante symmetric players," Games and Economic Behavior, Elsevier, vol. 136(C), pages 1-30.
    7. Aner Sela & Oz Tsahi, 2020. "On the optimal allocation of prizes in best-of-three all-pay auctions," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 55(2), pages 255-273, August.
    8. Chen, Bo & Serena, Marco & Wang, Zijia, 2024. "Disclosure policies in all-pay auctions with affiliated values," Economic Modelling, Elsevier, vol. 141(C).
    9. Chen, Zhuoqiong, 2025. "Know thy enemy: Information acquisition in contests," European Economic Review, Elsevier, vol. 177(C).
    10. Lu, Jingfeng & Shen, Bo & Wang, Zhewei, 2024. "Performance bundling in multi-dimensional competitions," International Journal of Industrial Organization, Elsevier, vol. 95(C).
    11. Häfner, Samuel, 2017. "A tug-of-war team contest," Games and Economic Behavior, Elsevier, vol. 104(C), pages 372-391.
    12. 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.
    13. Feng, Xin & Lu, Jingfeng, 2018. "How to split the pie: Optimal rewards in dynamic multi-battle competitions," Journal of Public Economics, Elsevier, vol. 160(C), pages 82-95.
    14. Chen, Bo, 2020. "Disclosure policies in research contests with stochastic entry," Economics Letters, Elsevier, vol. 191(C).
    15. Stefano Barbieri, 2026. "Sequential team contests: alternating or specializing?," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 81(3), pages 807-834, May.
    16. Feng, Xin & Jiao, Qian & Kuang, Zhonghong & Lu, Jingfeng, 2024. "Optimal prize design in team contests with pairwise battles," Journal of Economic Theory, Elsevier, vol. 215(C).
    17. Gelder, Alan & Kovenock, Dan, 2017. "Dynamic behavior and player types in majoritarian multi-battle contests," Games and Economic Behavior, Elsevier, vol. 104(C), pages 444-455.
    18. Qiang Fu & Jingfeng Lu & Yue Pan, 2015. "Team Contests with Multiple Pairwise Battles," American Economic Review, American Economic Association, vol. 105(7), pages 2120-2140, July.
    19. Lauber, Arne & March, Christoph & Sahm, Marco, 2023. "Optimal and fair prizing in sequential round-robin tournaments: Experimental evidence," Games and Economic Behavior, Elsevier, vol. 141(C), pages 30-51.
    20. Aner Sela, 2016. "Two Stage Contests With Effort-Dependent Rewards," Working Papers 1612, Ben-Gurion University of the Negev, Department of Economics.

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

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