Approximate nash equilibria for multi-player games

Abstract

We consider games of complete information with r ≥ 2 players, and study approximate Nash equilibria in the additive and multiplicative sense, where the number of pure strategies of the players is n. We establish a lower bound of on the size of the support of strategy profiles which achieve an ε-approximate equilibrium, for in the additive case, and ε