On Equilibrium in Pure Strategies in Games with Many Players

Treating games of incomplete information with countable sets of actions and types and finite but large player sets we demonstrate that for every mixed strategy profile there is a pure strategy profile that is 'epsilon-equivalent'. Our framework introduces and exploits a distinction between crowding attributes of players (their external effects on others) and their taste attributes (their payoff functions and any other attributes that are not directly relevant to other players). The main assumption is a 'large game' property, dictating that the actions of relatively small subsets of players cannot have large effects on the payoffs of others Since it is well known that, even allowing mixed strategies, with a countable set of actions a Nash equilibrium may not exist, we provide an existence of equilibrium theorem. The proof of existence relies on a relationship between the 'better reply security' property of Reny (1999) and a stronger version of the large game property. Our purification theorem are based on a new mathematical result, of independent interest, applicable to countable strategy spaces.