We study models of learning in games where agents with limited memory use social information to decide when and how to change their play. When agents only observe the aggregate distribution of payoffs and only recall information from the last period, aggregate play comes close to Nash equilibrium for generic games, and pure equilibria are generally more stable than mixed equilibria. When agents observe both the payoff distribution of other agents and the actions that led to those payoffs and can remember this for some time, the length of their memory plays a key role: With short memories, aggregate play may not come close to Nash equilibrium unless the game satisfies an acyclicity condition. When agents have sufficiently long memory generically aggregate play comes close to Nash equilibrium. However, unlike in the model where social information is solely about how well other agents are doing, mixed equilibria can be favored over pure ones.
Social learning Nash equilibrium best response dynamics equilibrium selection