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 r-1((ln n-2 ln ln n-ln r)/(ln r)){sup}(1/2) on the size of the support of strategy profiles which achieve an ε-approximate equilibrium, for ε<(r-1)/r in the additive case, and ε展开▼
