IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v151y2025icp1-23.html
   My bibliography  Save this article

Optimal tree contest design and winner-take-all

Author

Listed:
  • Jiao, Qian
  • Kuang, Zhonghong
  • Liu, Yiran
  • Yu, Yang

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.

Suggested Citation

  • Jiao, Qian & Kuang, Zhonghong & Liu, Yiran & Yu, Yang, 2025. "Optimal tree contest design and winner-take-all," Games and Economic Behavior, Elsevier, vol. 151(C), pages 1-23.
    • Handle: RePEc:eee:gamebe:v:151:y:2025:i:c:p:1-23
    DOI: 10.1016/j.geb.2025.02.007
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S089982562500020X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2025.02.007?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Keywords

    Tree contest; Prize allocation; Winner-take-all; Contest architecture;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D72 - Microeconomics - - Analysis of Collective Decision-Making - - - Political Processes: Rent-seeking, Lobbying, Elections, Legislatures, and Voting Behavior

    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:eee:gamebe:v:151:y:2025:i:c:p:1-23. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    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.