We study Blackwell's approachability in repeated games with vector payoffs when the approaching player is restricted to use strategies with bounded memory: either strategies with bounded recall, or strategies that can be implemented by finite automata. Our main finding is that the following...

Abstract We study the structure of the set of equilibrium payoffs in finite games, both for Nash and correlated equilibria. In the two-player case, we obtain a full characterization: if U and P are subsets of , then there exists a bimatrix game whose sets of Nash and correlated equilibrium...