SEQUENTIAL CONTESTS WITH SYNERGY AND BUDGET CONSTRAINTS
Aner Sela and
Reut Megidish
Additional contact information
Reut Megidish: BGU
No 1212, Working Papers from Ben-Gurion University of the Negev, Department of Economics
Abstract:
We study a sequential Tullock contest with two stages and two identical prizes. The players compete for one prize in each stage and each player may win either one or two prizes. The players have either decreasing or increasing marginal values for the prizes, which are commonly known, and there is a con- straint on the total effort that each player can exert in both stages. We analyze the players' allocations of efforts along both stages when the budget constraints (effort constraints) are either restrictive, non- restrictive or partially restrictive. In particular, we show that when the players are either symmetric or asymmetric and the budget constraints are restrictive, independent of the players'values for the prizes, each player allocates his effort equally along both stages of the contest.
Keywords: Sequential contests; Tullock contests; budget constrains. (search for similar items in EconPapers)
JEL-codes: D44 O31 O32 (search for similar items in EconPapers)
Pages: 29 pages
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://in.bgu.ac.il/en/humsos/Econ/Workingpapers/1212.pdf (application/pdf)
Related works:
Journal Article: Sequential contests with synergy and budget constraints (2014) 
Working Paper: Sequential Contests with Synergy and Budget Constraints (2011) 
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:bgu:wpaper:1212
Access Statistics for this paper
More papers in Working Papers from Ben-Gurion University of the Negev, Department of Economics Contact information at EDIRC.
Bibliographic data for series maintained by Aamer Abu-Qarn ().