Abstract

According to conventional wisdom, Nash equilibrium in a game “involves” common knowl-edge of the payoff functions, of the rationality of the players, and of the strategies played. The basis for this wisdom is explored, and it turns out that considerably weaker conditions suffice. First, note that if each player is rational and knows his own payoff function, and the strategy choices of the players are mutually known, then these choices form a Nash equilibrium. The other two results treat the mixed strategies of a player not as conscious randomization of that player, but as conjectures of the other players about what he will do. When n = 2, mutual knowledge of the payoff functions, of rationality, and of the conjectures yields Nash equilibrium. When n ≥ 3, mutual knowledge of the payoff functions and of rationality, and common knowl-edge of the conjectures yield Nash equilibrium when there is a common prior. Examples are provided showing these results to be sharp.

Citations