Optimal Ties in Contests
Abstract
I analyze a mechanism design of a tournament in which the principal can strategically enhance the probability of a tie. The principal decides on a âtie distanceâ and announces a rule according to which a tie is declared if the difference between the two contestantsâ performances is within the tie distance. I show that the contestantsâ equilibrium efforts do not depend on the prizes awarded in case of a tie. I find that there are cases in which the optimal mechanism has a positive tie distance.(This abstract was borrowed from another version of this item.)
Download Info
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.Bibliographic Info
Paper provided by UCLA Department of Economics in its series Levine's Bibliography with number 321307000000000374.Length:
Date of creation: 11 Sep 2006
Date of revision:
Handle: RePEc:cla:levrem:321307000000000374
Contact details of provider:
Web page: http://www.dklevine.com/
Related research
Keywords:Other versions of this item:
- Maya Eden, 2006. "Optimal Ties in Contests," Discussion Paper Series dp430, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- D44 - Microeconomics - - Market Structure and Pricing - - - Auctions
- J33 - Labor and Demographic Economics - - Wages, Compensation, and Labor Costs - - - Compensation Packages; Payment Methods
This paper has been announced in the following NEP Reports:
- NEP-ALL-2006-09-16 (All new papers)
References
References listed on IDEASPlease 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.:
- Lazear, Edward P & Rosen, Sherwin, 1981.
"Rank-Order Tournaments as Optimum Labor Contracts,"
Journal of Political Economy,
University of Chicago Press, vol. 89(5), pages 841-64, October.
- Edward P. Lazear & Sherwin Rosen, 1979. "Rank-Order Tournaments as Optimum Labor Contracts," NBER Working Papers 0401, National Bureau of Economic Research, Inc.
- Alex Gershkov & Motty Perry, 2006.
"Tournaments with Midterm Reviews,"
Discussion Paper Series
dp414, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- Gershkov, Alex & Perry, Motty, 2009. "Tournaments with midterm reviews," Games and Economic Behavior, Elsevier, vol. 66(1), pages 162-190, May.
- Gershkov, Alex & Perry, Motty, 2006. "Tournaments with Midterm Reviews," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 145, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
- Alex Gershkov & Motty Perry, 2006. "Tournaments with Midterm Reviews," Levine's Bibliography 122247000000001229, UCLA Department of Economics.
- 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.
- Moldovanu, Benny & Sela, Aner, 1999. "The Optimal Allocation of Prizes in Contests," Sonderforschungsbereich 504 Publications 99-75, Sonderforschungsbereich 504, Universität Mannheim & Sonderforschungsbereich 504, University of Mannheim.
- Cohen, Daniel & Sela, Aner, 2005. "Contests with Ties," CEPR Discussion Papers 5132, C.E.P.R. Discussion Papers.
- Pradeep Dubey & John Geanakoplos, 2004. "Grading Exams: 100, 99, ..., 1 or A, B, C? Incentives in Games of Status," Cowles Foundation Discussion Papers 1467, Cowles Foundation for Research in Economics, Yale University.
Citations
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:cla:levrem:321307000000000374For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (David K. Levine).
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.

