EconPapers    
Economics at your fingertips  
 

The Optimal Rewards in Contests

Chen Cohen, Todd Kaplan and Aner Sela
Additional contact information
Chen Cohen: BGU

No 501, Working Papers from Ben-Gurion University of the Negev, Department of Economics

Abstract: We study all-pay contests under incomplete information where the reward is a func- tion of the contestant's type and also of his effort. We analyze the optimal reward for the designer when the reward is either multiplicatively separable or additively separable in effort and type. In the multiplicatively separable environment the optimal reward is always positive while in the additively separable environment it may also be negative. In both environments, depending on the designer's utility, the optimal reward may either increase or decrease in the contestants' effort. Finally, in both environments, the designer's payoff depends only upon the expected value of the effort-dependent rewards and not the number of rewards.

Keywords: Contests; All-Pay Auctions; Optimal Design. (search for similar items in EconPapers)
JEL-codes: D44 O31 (search for similar items in EconPapers)
Pages: 29 pages
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://in.bgu.ac.il/en/humsos/Econ/Workingpapers/0501.pdf (application/pdf)

Related works:
Journal Article: Optimal rewards in contests (2008) Downloads
Working Paper: Optimal Rewards in Contests (2004) Downloads
Working Paper: The Optimal Rewards in Contests (2004) Downloads
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:0501

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 ().

 
Page updated 2025-04-03
Handle: RePEc:bgu:wpaper:0501