Advanced Search
MyIDEAS: Login to save this paper or follow this series

Optimal Ties in Contests

Contents:

Author Info

  • Maya Eden

    ()

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.

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.
File URL: http://ratio.huji.ac.il/sites/default/files/publications/dp430.pdf
Download Restriction: no

Bibliographic Info

Paper provided by The Center for the Study of Rationality, Hebrew University, Jerusalem in its series Discussion Paper Series with number dp430.

as in new window
Length: 14 pages
Date of creation: Sep 2006
Date of revision:
Handle: RePEc:huj:dispap:dp430

Contact details of provider:
Postal: Feldman Building - Givat Ram - 91904 Jerusalem
Phone: +972-2-6584135
Fax: +972-2-6513681
Email:
Web page: http://www.ratio.huji.ac.il/
More information through EDIRC

Related research

Keywords: Tournament; Strategic ties;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
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.:
as in new window
  1. Gershkov, Alex & Perry, Motty, 2009. "Tournaments with midterm reviews," Games and Economic Behavior, Elsevier, vol. 66(1), pages 162-190, May.
  2. 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.
  3. 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.
  4. 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.
  5. Cohen, Daniel & Sela, Aner, 2005. "Contests with Ties," CEPR Discussion Papers 5132, C.E.P.R. Discussion Papers.
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:huj:dispap:dp430. 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: (Ilan Nehama).

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.