A foundation for markov equilibria in sequential games with finite social memory

We study stochastic games with an infinite horizon and sequential moves played by an arbitrary number of players. We assume that social memory is finite-every player, except possibly one, is finitely lived and cannot observe events that are sufficiently far backin the past. This classof games includes games between a long-run player and a sequence of short-run players, and games with overlapping generations of players. An equilibrium is purifiable if some close-by behaviour is consistent with equilibrium when agents' payoffs in each period are perturbed additively and independently. We show that only Markov equilibria are purifiable when social memory is finite. Thus if a game has at most one long-run player, all purifiable equilibria are Markov.