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...

The present paper constructs a novel solution to the chopstick auction, and thereby disproves a conjecture 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...

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...

Biconcavity is a simple condition on inverse demand that corresponds to the ordinary concept of concavity after simultaneous parameterized transformations of price and quantity. The notion is employed here in the framework of the homogeneous-good Cournot model with potentially heterogeneous...

This paper studies Colonel Blotto games with two battlefields where one player has a head start in the form of additional troops on one of the battlefields. Such games arise naturally in marketing, electoral competition, and military conflict. Sion and Wolfe (1957) have shown that, if the...

This paper studies the incentives for interim voluntary disclosure of verifiable information in probabilistic all-pay contests. Provided that the contest is uniformly asymmetric, full revelation is the unique perfect Bayesian equilibrium outcome. This is so because the weakest type of the...

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 non-trivial two-player zero-sum game that...

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 studies fictitious play in networks of noncooperative two-person games. We show that continuous-time fictitious play converges to the set of Nash equilibria if the overall n-person game is zero-sum. Moreover, the rate of convergence is 1/T, regardless of the size of the network. In...

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...