Two-stage elimination contests with optimal head starts
Guy Maor and
Aner Sela ()
Additional contact information
Noam Cohen: Ben-Gurion University of the Negev
Guy Maor: Ben-Gurion University of the Negev
Aner Sela: Ben-Gurion University of the Negev
Review of Economic Design, 2018, vol. 22, issue 3, 177-192
Abstract We study two-stage elimination Tullock contests. In the first stage all the players compete against each other; then some advance to the second stage while the others are removed. The finalists compete against each other in the second stage, and one of them wins the prize. To maximize the expected total effort, the designer can give a head start to the winner of the first stage when he competes against the other finalists in the second stage. We show that the optimal head start, independent of the number of finalists, always increases the players’ expected total effort. We also show how the number of players and finalists affect the value of the optimal head start.
Keywords: Multi-stage contests; Tullock contests; Head starts (search for similar items in EconPapers)
JEL-codes: C70 D44 L12 O32 (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
http://link.springer.com/10.1007/s10058-018-0216-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:reecde:v:22:y:2018:i:3:d:10.1007_s10058-018-0216-1
Ordering information: This journal article can be ordered from
Access Statistics for this article
Review of Economic Design is currently edited by Atila Abdulkadiroglu, Fuhito Kojima and Tilman Börgers
More articles in Review of Economic Design from Springer, Society for Economic Design
Bibliographic data for series maintained by Sonal Shukla ().