The Hotelling game of pure location allows interpretations in spatial competition, political theory, and professional forecasting. In this paper, the doubly symmetric mixed-strategy equilibrium for n ≥ 4 firms is characterized as the solution of a well-behaved boundary value problem. The...

Optimal rank-order tournaments have traditionally been studied using a first-order approach. The present analysis relies instead on the construction of an "upper envelope" over all incentive compatibility conditions. lt turns out that the first-order approach is not innocuous. For example, in...

This paper considers rent-seeking games in which a small percentage change in a player's bid has a large percentage impact on her odds of winning, i.e., on the ratio of her respective probabilities of winning and losing. An example is the Tullock contest with a high R. The analysis provides a...

In a less widely known contribution, Béla Martos (1966, Hungarian Academy of Sciences) introduced a generalized notion of concavity that is closely related to what is nowadays known as r-concavity in the operations research literature, and that is identical to what is nowadays known as...

The axiomatic route to the foundation of contest success functions (CSF) has proved to be both useful and prolific. The standard approach in the literature is based on the decision-theoretic notion that choice probabilities should be independent of irrelevant alternatives (Skaperdas, Economic...

Optimal rank-order tournaments have traditionally been studied using a first-order approach. The present analysis relies instead on the construction of an "upper envelope" over all incentive compatibility conditions. It turns out that the first-order approach is not innocuous. For example, in...

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

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