Based on a model introduced by Kaminsky, Luks, and Nelson (1984), we consider a zero-sum allocation game called the Gladiator Game, where two teams of gladiators engage in a sequence of one-to-one fights in which the probability of winning is a function of the gladiators' strengths. Each team's...

How many pure Nash equilibria can we expect to have in a finite game chosen at random? Solutions to the above problem have been proposed in some special cases. In this paper we assume independence among the profiles, but we allow either positive or negative dependence among the players' payoffs...

We consider a Hotelling game where a finite number of retailers choose a location, given that their potential customers are distributed on a network. Retailers do not compete on price but only on location, therefore each consumer shops at the closest store. We show that when the number of...

Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Waldʼs pick-the-larger-integer game. Several authors have provided conditions for the existence of equilibria in infinite games. These conditions are...