In a dynamic model of sports competition, we show that when spectators care only about the level of effort exerted by contestants, rewarding schemes that depend linearly on the final score difference provide more efficient incentives for efforts than schemes based only on who wins and loses. This result is puzzling because rank order schemes are the dominant forms of reward in sports competitions. The puzzle can be explained if one takes into account the fact that spectators also care about the suspense in the game. We define spectators\\' demand for suspense as greater utility derived from contestants\\' efforts when the game is closer. As the demand for suspense increases, so does the advantage of rank order schemes relative to linear score difference schemes. When the demand for suspense is sufficiently high, the optimal rank order scheme dominates all linear score difference schemes, and with plausible additional restrictions, it dominates a broad class of incentive schemes that reward contestants on the basis of the final score difference.
|Date of creation:||20 Apr 2006|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: (416) 978-5283
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.:
- Stefan Szymanski & Stefan KÈsenne, 2004.
"Competitive balance and gate revenue sharing in team sports,"
Journal of Industrial Economics,
Wiley Blackwell, vol. 52(1), pages 165-177, 03.
- SZYMANSKI, Stefan & KÉSENNE, Stefan, 2003. "Competitive balance and gate revenue sharing in team sports," Working Papers 2003003, University of Antwerp, Faculty of Applied Economics.
When requesting a correction, please mention this item's handle: RePEc:tor:tecipa:tecipa-223. 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: (RePEc Maintainer)
If references are entirely missing, you can add them using this form.