Optimal tree contest design and winner-take-all

Qian Jiao, Zhonghong Kuang, Yiran Liu and Yang Yu

Games and Economic Behavior, 2025, vol. 151, issue C, 1-23

Abstract: This paper investigates the effort-maximizing design of multi-stage contests with tree-like architectures, focusing on both contest architecture and prize structure. Given the architecture, we show that the whole budget should be assigned to a single match. This match must be the final if the architecture is symmetric. Moreover, the winner-take-all rule proves to be optimal if the contest organizer can jointly design the architecture and prize structure. To determine the optimal contest architecture, we use dynamic programming and induction to provide a tight upper bound for the optimized total effort level. Our new approach extends the findings of Gradstein and Konrad (1999), offering new insights into how the optimal architecture hinges on the noise level of matches.

Keywords: Tree contest; Prize allocation; Winner-take-all; Contest architecture (search for similar items in EconPapers)
JEL-codes: C72 D72 (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S089982562500020X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:151:y:2025:i:c:p:1-23

DOI: 10.1016/j.geb.2025.02.007

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().