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 considers all-pay contests in which the relationship between bids and allocations 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...

While smooth exact potential games are easily characterized in terms of the cross-derivatives of players' payoff functions, an analogous differentiable characterization of ordinal or generalized ordinal potential games has been elusive for a long time. In this paper, it is shown that the...

In the class of smooth non-cooperative games, exact potential games and weighted potential games are known to admit a convenient characterization in terms of cross-derivatives (Monderer and Shapley, 1996a). However, no analogous characterization is known for ordinal potential games. The present...

We consider a class of incomplete-information Colonel Blotto games in which N Ï 2 agents are engaged in (N + 1) battlefields. An agent's vector of battlefield valuations is drawn from a generalized sphere in Lp-space. We identify a Bayes-Nash equilibrium in which any agent's resource allocation...

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

We characterize the equilibrium set of the n-player Hirshleifer contest with homogeneous valuations. A symmetric equilibrium always exists. It necessarily corresponds to multilateral peace for sufficient noise and uses finite-support randomized strategies otherwise. Asymmetric equilibria are...