A consistent pair specifies a set of "rational" strategies for both players such that a strategy is rational if and only if it is a best reply to a Bayesian belief that gives positive probability to every rational strategy of the opponent and probability zero otherwise. Although the idea...

Szidarovszky and Okuguchi (Games and Economic Behavior, 1997) have provided useful conditions for the existence of a unique pure-strategy Nash equilibrium in rent-seeking games of complete information. In this paper, we generalize their results to contests with incomplete informa tion. Two...

This paper considers all-pay contests in which the relationship between bids and allocation reflects a small amount of noise. Prior work had focused on one particular equilibrium. However, there may be other equilibria. To address this issue, we introduce a new and intuitive measure for the...

This paper constructs a novel equilibrium in the chopstick auction of Szentes and Rosenthal (Games and Economic Behavior, 2003a, 2003b). In contrast to the existing solution, the identified equilibrium strategy allows a simple and intuitive characterization. Moreover, its best-response set has...

This paper studies fictitious play in networks of noncooperative two-player games. We show that continuous-time fictitious play converges to Nash equilibrium provided that the overall game is zero-sum. Moreover, the rate of convergence is 1/T , regardless of the size of the network. In contrast,...

It is shown that the n-player lottery contest admits a best-response potential (Voorneveld, 2000, Economics Letters). This is true also when the contest technology reflects the possibility of a draw. The result implies, in particular, the existence of a nontrivial example of a strictly...

It is shown that the equilibrium in the asymmetric Tullock contest is unique for parameter values r È 2. This allows proving a revenue ranking result saying that a revenue-maximizing designer capable of biasing the contest always prefers a contest technology with higher accuracy.

This paper studies incentives for the interim voluntary disclosure of verifiable information in probabilistic all-pay contests. Considered are unfair contests, i.e., contests in which, subject to activity conditions, one player (the favorite) is interim always more likely to win than the other...

The symmetric two-player Hirshleifer (1989) contest is shown to admit a unique equilibrium. The support of the equilibrium strategy is finite and includes, in particular, the zero expenditure level. We also establish a lower bound for the cardinality of the support and an upper bound for the...

This paper examines multi-battle contests whose extensive form can be represented in terms of a finite state machine. We start by showing that any contest that satisfies our assumptions decomposes into two phases, a principal phase (in which states cannot be revisited) and a concluding...