Advanced Search
MyIDEAS: Login

Contests with Ties

Contents:

Author Info

  • Cohen, Daniel
  • Sela, Aner

Abstract

We study all-pay contests in which there is a positive probability of a tied outcome. We analyse both one-stage contests and multi-stage contests with tie-breaks. We demonstrate that in symmetric two-player contests, the designer does not have an incentive to award a prize in a case of a tie. Consequently, in symmetric multi-stage two-player contests, the designer should allow an unlimited number of tie-breaks until a winner is decided.

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://www.cepr.org/pubs/dps/DP5132.asp
Download Restriction: CEPR Discussion Papers are free to download for our researchers, subscribers and members. If you fall into one of these categories but have trouble downloading our papers, please contact us at subscribers@cepr.org

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.

Bibliographic Info

Paper provided by C.E.P.R. Discussion Papers in its series CEPR Discussion Papers with number 5132.

as in new window
Length:
Date of creation: Jul 2005
Date of revision:
Handle: RePEc:cpr:ceprdp:5132

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:

Related research

Keywords: all-pay auctions; contests;

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. Baye, M. & Kovenock, D. & Vries, C. de, 1990. "The All-Pay Auction with Complete Information," Discussion Paper 1990-51, Tilburg University, Center for Economic Research.
  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. Che, Yeon-Koo & Gale, Ian L, 1998. "Caps on Political Lobbying," American Economic Review, American Economic Association, vol. 88(3), pages 643-51, June.
  4. Dobson,Stephen & Goddard,John, 2011. "The Economics of Football," Cambridge Books, Cambridge University Press, number 9780521517140.
  5. 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.
  6. Amann, Erwin & Leininger, Wolfgang, 1996. "Asymmetric All-Pay Auctions with Incomplete Information: The Two-Player Case," Games and Economic Behavior, Elsevier, vol. 14(1), pages 1-18, May.
  7. Clark, Derek J & Riis, Christian, 1998. "Competition over More Than One Prize," American Economic Review, American Economic Association, vol. 88(1), pages 276-89, March.
  8. Vijay Krishna & John Morgan, 1994. "An Analysis of the War of Attrition and the All-Pay Auction," Game Theory and Information 9409002, EconWPA.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Maya Eden, 2006. "Optimal Ties in Contests," Levine's Bibliography 321307000000000374, UCLA Department of Economics.

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:cpr:ceprdp:5132

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().

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.