A contest success function for rankings
Alberto Vesperoni ()
Social Choice and Welfare, 2016, vol. 47, issue 4, No 6, 905-937
Abstract In a contest, several candidates compete for winning prizes by expending costly efforts. We assume that the outcome of a contest is a ranking, which is an ordered partition of the set of candidates. We consider rankings of any type (i.e., with any number of candidates at each rank), and define a class of success functions that assign probabilities to all rankings of a given type for each configuration of candidates’ efforts. Our framework can be interpreted as the probabilistic choice of a committee that allocates a given set of prizes following a mix of objective and subjective criteria, where the former depend on candidates’ efforts while the latter are random. We axiomatically characterize our class of success functions and illustrate its relevant features to contest games.
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3) Track citations by RSS feed
Downloads: (external link)
http://link.springer.com/10.1007/s00355-016-0997-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Working Paper: A contest success function for rankings (2013)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:spr:sochwe:v:47:y:2016:i:4:d:10.1007_s00355-016-0997-5
Ordering information: This journal article can be ordered from
http://www.springer. ... c+theory/journal/355
Access Statistics for this article
Social Choice and Welfare is currently edited by Bhaskar Dutta, Marc Fleurbaey, Elizabeth Maggie Penn and Clemens Puppe
More articles in Social Choice and Welfare from Springer, The Society for Social Choice and Welfare Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().