2006
DOI: 10.1016/j.jet.2004.10.004
|View full text |Cite
|
Sign up to set email alerts
|

Contest architecture

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
201
4

Year Published

2008
2008
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 306 publications
(206 citation statements)
references
References 17 publications
1
201
4
Order By: Relevance
“…The central concern in much of this literature is exploring how solvers can be induced to provide good solutions on average (Krishna andMorgan 1997, Moldovanu andSela 2001). That being said, there is some research (e.g., Moldovanu and Sela 2006) that focuses also on the best entry's performance.…”
Section: Related Literaturementioning
confidence: 99%
“…The central concern in much of this literature is exploring how solvers can be induced to provide good solutions on average (Krishna andMorgan 1997, Moldovanu andSela 2001). That being said, there is some research (e.g., Moldovanu and Sela 2006) that focuses also on the best entry's performance.…”
Section: Related Literaturementioning
confidence: 99%
“…Some general insights to the problem were provided by Moldovanu and Sela (2001;2006) and references therein, advocating for some discriminatory features of contests.…”
Section: The Regulator' S Optimal Choice Of Allocationsmentioning
confidence: 99%
“…When there is no individual-speci…c noise involved in the observation of …rms'actions, one can implement a rank-order contest, which is, in e¤ect, a multi-prize allpay auction (Glazer and Hassin 1988;Barut and Kovenock 1998;Clark and Riis 1998;Moldovanu and Sela 2001;2006). This di¤ers from tournaments as agents in rank-order contest models are generally assumed to have a deterministic relationship between e¤ort and actions.…”
Section: Introductionmentioning
confidence: 99%
“…Moldovanu and Sela [19] analyze (amongst others) the question of whether a contest should be split into several sub-contests in a situation of private pre-decision information. They prove that for linear or convex cost functions, the grand contest generates a higher expected output than any contest divided into subgroups of equal size (ibid., Theorem 1).…”
Section: Contest Designmentioning
confidence: 99%
“…The coefficients in (19) are the expected values of the likelihood ratio order statistics under the exponential distribution with mean 1. The cost minimizing prize structure is given by w 1 = 0, w 2 = (6/7) 2 and w 3 = (18/7) 2 .…”
Section: Optimal Reward Structurementioning
confidence: 99%