Competitive Problem Solving and the Optimal Prize Schemes
Agents compete to solve a problem. Each agent knows own computational capacity as private information and simultaneously chooses either a risky or a safe problem solving method. This paper analyzes the optimal prize schemes from the perspective of the prize designer who wishes to find a solution as quick as possible. It is shown that (i) the winner- take-all scheme can induce excessive risk taking and make problem solving slower (ii) prize schemes with milder competitive pressure induce the optimal risk taking and quicker problem solving.
|Date of creation:||02 Dec 2010|
|Date of revision:|
|Contact details of provider:|| Postal: Carl-Zeiss-Strasse 3, 07743 JENA|
Phone: +049 3641/ 9 43000
Fax: +049 3641/ 9 43000
Web page: http://www.jenecon.de
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.:
- Moldovanu, Benny & Sela, Aner, 2002.
Sonderforschungsbereich 504 Publications
02-06, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
- Yeon-Koo Che & Ian Gale, 2000.
"Optimal Design of Research Contests,"
Econometric Society World Congress 2000 Contributed Papers
1784, Econometric Society.
- Kräkel, Matthias, 2007.
"Optimal Risk Taking in an Uneven Tournament Game with Risk Averse Players,"
Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems
200, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
- Kräkel, Matthias, 2008. "Optimal risk taking in an uneven tournament game with risk averse players," Journal of Mathematical Economics, Elsevier, vol. 44(11), pages 1219-1231, December.
- Matthias Kräkel, 2007. "Optimal Risk Taking in an Uneven Tournament Game with Risk Averse Players," Bonn Econ Discussion Papers bgse4_2007, University of Bonn, Germany.
- Edward P. Lazear & Sherwin Rosen, 1979.
"Rank-Order Tournaments as Optimum Labor Contracts,"
NBER Working Papers
0401, National Bureau of Economic Research, Inc.
- Jean Tirole, 1988. "The Theory of Industrial Organization," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262200716, December.
- Hvide, H.K., 1999.
"Tournament Rewards and Risk Taking,"
32-99, Tel Aviv.
- Hans K. Hvide, 2000. "Tournament Rewards and Risk Taking," Econometric Society World Congress 2000 Contributed Papers 0163, Econometric Society.
- Hvide, H.K. & Kristiansen, E.G., 1999.
"Risk Taking in Selection Contests,"
5-99, Tel Aviv.
- 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.
- Fershtman, Chaim & Rubinstein, Ariel, 1997. "A Simple Model of Equilibrium in Search Procedures," Journal of Economic Theory, Elsevier, vol. 72(2), pages 432-441, February.
- Taylor, Curtis R, 1995. "Digging for Golden Carrots: An Analysis of Research Tournaments," American Economic Review, American Economic Association, vol. 85(4), pages 872-90, September.
- Dekel, Eddie & Scotchmer, Suzanne, 1999.
"On the Evolution of Attitudes towards Risk in Winner-Take-All Games,"
Journal of Economic Theory,
Elsevier, vol. 87(1), pages 125-143, July.
- Dekel, E. & Scotchmer, S., 1999. "On the Evolution of Attitudes Towards Risk in Winner-Take-All Games," Papers 4-99, Tel Aviv.
- Madhav V. Rajan & Stefan Reichelstein, 2006. "Subjective Performance Indicators and Discretionary Bonus Pools," Journal of Accounting Research, Wiley Blackwell, vol. 44(3), pages 585-618, 06.
When requesting a correction, please mention this item's handle: RePEc:jrp:jrpwrp:2010-083. 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: (Markus Pasche)
If references are entirely missing, you can add them using this form.