FOUNDATIONS FOR CONTEST SUCCESS FUNCTIONS
We examine two approaches to contest success functions. In the first we analyze the implications of contestants´ incomplete information concerning the `type´ of the contest administrator. While in the case of two contestants this approach can rationalize prominent contest success functions, we show that it runs into difficulties when there are more agents. Our second approach interprets contest success functions as sharing rules and establishes a connection to bargaining and claims problems which is independent of the number of contestants. Both approaches provide foundations for popular contest success functions and guidelines for the definition of new ones.
Year of publication: |
2007-01
|
---|---|
Authors: | Corchon, Luis ; Dahm, Matthias |
Institutions: | Departamento de Economía, Universidad Carlos III de Madrid |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Welfare maximizing contest success functions when the planner cannot commit
Corchon, Luis, (2009)
-
Blazsek, Szabolcs, (2014)
-
Unbiased QML Estimation of Log-GARCH Models in the Presence of Zero Returns
Sucarrat, Genaro, (2013)
- More ...