Biased contests for symmetric players

B-Tier
Journal: Games and Economic Behavior
Year: 2017
Volume: 103
Issue: C
Pages: 116-144

Authors (2)

Drugov, Mikhail (not in RePEc) Ryvkin, Dmitry (RMIT University)

Score contribution per author:

1.005 = (α=2.01 / 2 authors) × 1.0x B-tier

α: calibrated so average coauthorship-adjusted count equals average raw count

Abstract

In a biased contest, one of the players has an advantage in the winner determination process. We characterize a novel class of biased contest success functions pertaining to such contests and provide necessary and sufficient conditions for zero bias to be a critical point of arbitrary objectives satisfying certain symmetry restrictions. We, however, challenge the common wisdom that unbiased contests are always optimal when contestants are symmetric ex ante or even ex post. We show that contests with arbitrary favorites, i.e., biased contests of symmetric players, can be optimal in terms of various objectives such as expected aggregate effort, the probability to reveal the stronger player as the winner or expected effort of the winner.

Technical Details

RePEc Handle
repec:eee:gamebe:v:103:y:2017:i:c:p:116-144
Journal Field
Theory
Author Count
2
Added to Database
2026-01-25