A contest success function for rankings

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


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
Original languageEnglish
Pages (from-to)905-937
Issue number4
Early online date27 Nov 2016
Publication statusPublished - Dec 2016


Dive into the research topics of 'A contest success function for rankings'. Together they form a unique fingerprint.

Cite this