We examine equilibrium selection in a two-stage sequential elimination contest in which contestants compete for a single prize. This game has a continuum of equilibria, only one of which satisfies the Coalition-Proof Nash Equilibrium (CPNE) refinement. That equilibrium involves “burning out” by using all of one’s resources in the first stage. It is Pareto-dominated by many other equilibria. We find that CPNE predicts well when four people compete, but not when eight people compete for two second-stage spots. Using a cognitive hierarchy (CH) framework, we show that when the number of players and the mean number of thinking steps are large, the CH prediction involves burning out. This provides a partial explanation of our results. We also develop a formal argument as to why CPNE logic is more compelling with more players. We conclude that more competition leads to higher bids, and that burning out is indeed a competitive phenonemon.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by University of Guelph, Department of Economics in its series Working Papers with number
0507.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)