Optimal information exchange in contests

Abstract

We study optimal exchange of private information in a two-player all-pay auction contest with independent private binary values. A benevolent information center who is informed about the players’ values facilitates the exchange of information by disclosing a signal publicly. The informativeness of the signal determines the monotonicity of the unique symmetric equilibrium and the players’ expected payoff. We characterize the upper bound of players’ expected payoff and the corresponding optimal signals utilizing such a relation between the informativeness and the payoff. When the players are ex ante sufficiently heterogeneous, the optimal signals work through an information-rent channel by inducing allocative efficient contests. When the players are ex ante sufficiently homogeneous, the optimal signals work through an unlevel-playing-field channel by inducing asymmetric contests. In order to guarantee efficient allocation, a regulator can punish any exchange of information when the players are sufficiently homogeneous and impose no restrictions when they are sufficiently heterogeneous.