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

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

Payoff security combined with reciprocal upper semicontinuity is sufficient for better-reply security, and consequently for the existence of a pure strategy Nash equilibrium in compact, quasiconcave games by Reny's (1999) theorem. Analogously, diagonal payoff security combined with upper...

Sion and Wolfe (1957) presented a two-person zero-sum game on the unit square without a value. In the present paper, we analyze finite-grid approximations of the Sion-Wolfe game. We find that, as the number of grid points tends to infinity and the payoff function approaches that of the infinite...

This paper studies the dynamic construction of a blockchain by competitive miners. In contrast to the literature, we assume a finite time horizon. It is shown that popular mining strategies such as adherence to conservative mining or to the longest-chain rule constitute pure-strategy Nash...

The paper studies a dynamic communication game in the presence of adverse selection and career concerns. A forecaster of privately known competence, who cares about his reputation, chooses the timing of the forecast regarding the outcome of some future event. We find that in all equilibria in a...

We experimentally study settings where an individual may have an incentive to adopt negative beliefs about another's intentions in order to justify egoistic behavior. Our first study uses a game in which a player can take money from an opponent in order to prevent the opponent from subsequently...

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

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

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