Common-Value All-Pay Auctions with Asymmetric Information

Working Paper: CEPR ID: DP9315

Authors: Ezra Einy; Ori Haimanko; Ram Orzach; Aner Sela

Abstract: We study two-player common-value all-pay auctions (contests) with asymmetric information under the assumption that one of the players has an information advantage over his opponent. We characterize the unique equilibrium in these contests, and examine the role of information in determining the players' expected efforts, probabilities of winning, and expected payoffs. In particular, we show that the players always have the same probability of winning the contest, and that their expected efforts are the same, but their expected payoffs are different. It is also shown that budget constraints may have an unanticipated effect on the players' expected payoffs, i.e., a player's information advantage may turn into a payoff disadvantage.

Keywords: All-Pay Auctions; Asymmetric Information; Information Advantage

JEL Codes: C72; D44; D82


Causal Claims Network Graph

Edges that are evidenced by causal inference methods are in orange, and the rest are in light blue.


Causal Claims

CauseEffect
asymmetric information (D82)expected payoffs (J33)
asymmetric information (D82)expected efforts (D29)
asymmetric information (D82)probability of winning (C25)
budget constraints (H60)expected payoffs (J33)
information advantage (D83)expected payoffs (J33)

Back to index