The Optimal Rewards in Contests
We study all-pay contests under incomplete information where the reward is a function 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.
|Date of creation:||Oct 2004|
|Contact details of provider:|| Postal: Streatham Court, Rennes Drive, Exeter EX4 4PU|
Phone: (01392) 263218
Fax: (01392) 263242
Web page: http://business-school.exeter.ac.uk/about/departments/economics/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Kaplan, Todd, et al, 2002. "All-Pay Auctions with Variable Rewards," Journal of Industrial Economics, Wiley Blackwell, vol. 50(4), pages 417-430, December.
- Benny Moldovanu & Aner Sela, 2001. "The Optimal Allocation of Prizes in Contests," American Economic Review, American Economic Association, vol. 91(3), pages 542-558, June.
- Che, Yeon-Koo & Gale, Ian L, 1998. "Caps on Political Lobbying," American Economic Review, American Economic Association, vol. 88(3), pages 643-651, June.
- Barut, Yasar & Kovenock, Dan, 1998. "The symmetric multiple prize all-pay auction with complete information," European Journal of Political Economy, Elsevier, vol. 14(4), pages 627-644, November.
- Baye, Michael R & Kovenock, Dan & de Vries, Casper G, 1993.
"Rigging the Lobbying Process: An Application of the All-Pay Auction,"
American Economic Review,
American Economic Association, vol. 83(1), pages 289-294, March.
- Baye, M.R. & Kovenock, D. & De Vries, C.G., 1991. "Rigging The Lobbying Process: An Application Of The All- Pay Auction," Purdue University Economics Working Papers 1002, Purdue University, Department of Economics.
- Baye, M.R. & Kovenock, D. & De Vries, C.G., 1992. "Rigging the Lobbying Process: An Application of the All- Pay Auction," Papers 9-92-2, Pennsylvania State - Department of Economics.
- Kaplan, Todd R. & Luski, Israel & Wettstein, David, 2003. "Innovative activity and sunk cost," International Journal of Industrial Organization, Elsevier, vol. 21(8), pages 1111-1133, October.
- Richard L. Fullerton & R. Preston McAfee, 1999. "Auctioning Entry into Tournaments," Journal of Political Economy, University of Chicago Press, vol. 107(3), pages 573-605, June. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:exe:wpaper:0402. 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: (Carlos Cortinhas)
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.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.