Optimal Rewards in Contests
We study all-pay contests under incomplete information where the reward is a function of the contestant's type and effort. We analyse 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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
|Date of creation:||Oct 2004|
|Date of revision:|
|Contact details of provider:|| Postal: Centre for Economic Policy Research, 77 Bastwick Street, London EC1V 3PZ.|
Phone: 44 - 20 - 7183 8801
Fax: 44 - 20 - 7183 8820
|Order Information:|| Email: |
When requesting a correction, please mention this item's handle: RePEc:cpr:ceprdp:4704. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If references are entirely missing, you can add them using this form.