## Repeated Games

In a repeated game players ${\displaystyle (I=\{1,2,\dots ,n\})}$ interact over ${\displaystyle T\leq \infty }$ periods. Each period represents a single iteration of the (simultaneous-move) stage game ${\displaystyle \Gamma }$ in which each player selects a strategy ${\displaystyle s_{i}\in S_{i}=\{s_{i}^{1},s_{i}^{2}\dots \}}$.

### Folk (general feasibility) Theorems

The multiplicity of strategy profiles made possible by repeated interaction translates to a wide variety of