Contest success functions (*)
Tournaments, conflict, and rent-seeking have been modelled as contests in which participants exert effort to increase their probability of winning a prize. A Contest Success Function (CSF) provides each player's probability of winning as a function of all players' efforts. In this paper the additive CSF employed in most contests is axiomatized, with an independence from irrelevant alternatives property as the key axiom. Two frequently used functional forms are also axiomatized: one in which winning probabilities depend on the ratio of players' efforts and the other in which winning probabilities depend on the difference in efforts.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Volume (Year): 7 (1996)
Issue (Month): 2 ()
|Note:||Received: February 4, 1994; revised version December 19, 1994|
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00199/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:7:y:1996:i:2:p:283-290. 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: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.