Existence of equilibria in countable games: An algebraic approach

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 typically of topological nature and are rarely applicable to countable games. Here we establish an existence result for the equilibrium of countable games when the strategy sets are a countable group, the payoffs are functions of the group operation, and mixed strategies are not requested to be σ-additive. As a byproduct we show that if finitely additive mixed strategies are allowed, then Wald?s game admits an equilibrium. Finally we extend the main results to uncountable games.