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

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

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