2014
DOI: 10.1016/j.jmateco.2014.02.004
|View full text |Cite
|
Sign up to set email alerts
|

Innovation contests with entry auction

Abstract: We consider procurement of an innovation from heterogeneous sellers. Innovations are random but depend on unobservable effort and private information. We compare two procurement mechanisms where potential sellers first bid in an auction for admission to an innovation contest. After the contest, an innovation is procured employing either a fixed prize or a first-price auction. We characterize Bayesian Nash equilibria such that both mechanisms are payoff-equivalent and induce the same efforts and innovations. In… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 37 publications
0
3
0
Order By: Relevance
“…In an innovation contest targeting a broad population of independent agents, all participants incur costs as a result of their efforts, but only the winner gets the reward. Within these two types of contests, authors deal with many aspects such as: single or multiple prizes (e.g., Dixit, ; Glazer & Hassin, ; Cason, Master & Sheremeta, ; Giebe, ), single or multiple solvers (e.g., Baye, Kovenock & de Vries, ; Fullerton & McAfee, ), complete or incomplete information scenarios (e.g., Cohen, Kaplan & Aner, ) or contest designs (e.g., Taylor, ; Baye, Kovenock & de Vries, ).…”
Section: Research Categoriesmentioning
confidence: 99%
“…In an innovation contest targeting a broad population of independent agents, all participants incur costs as a result of their efforts, but only the winner gets the reward. Within these two types of contests, authors deal with many aspects such as: single or multiple prizes (e.g., Dixit, ; Glazer & Hassin, ; Cason, Master & Sheremeta, ; Giebe, ), single or multiple solvers (e.g., Baye, Kovenock & de Vries, ; Fullerton & McAfee, ), complete or incomplete information scenarios (e.g., Cohen, Kaplan & Aner, ) or contest designs (e.g., Taylor, ; Baye, Kovenock & de Vries, ).…”
Section: Research Categoriesmentioning
confidence: 99%
“…In models of fixed-prize tournaments, Taylor (1995) shows that free entry is undesirable, and Fullerton and McAfee (1999) show that the optimal number of participants is 2. Fullerton and McAfee (1999) and Giebe (2014) consider the use of entry auctions in order to select the most efficient contestants. Fullerton et al (2002) find that buyers are better off with auctions than with fixed-prize tournaments.…”
Section: Relation To the Literaturementioning
confidence: 99%
“…See Baye et al. () and Che and Gale () for all‐pay auctions, Lazear and Rosen (), Fullerton and McAfee (), Schöttner (), and Giebe () for tournaments; see also the general discussion in Konrad ().…”
mentioning
confidence: 99%