Foundations for contest success functions (Q2268135)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5679474
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Foundations for contest success functions |
scientific article; zbMATH DE number 5679474 |
Statements
Foundations for contest success functions (English)
0 references
10 March 2010
0 references
This paper examines two approaches to contest success functions. In the first, it analyzes 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, it shows that it runs into difficulties when there are more agents. The second approach interprets contest success functions as sharing rules and establishes a connection to bargaining and claim 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.
0 references
endogenous contest
0 references
contest success function
0 references
Nash bargaining solution
0 references
bargaining with claims
0 references
0 references
0.88362527
0 references
0 references
0.8369856
0 references
0 references
0 references
0.7951275
0 references
0.7832966
0 references
