A Polynomial-time Nash Equilibrium Algorithm for Repeated Stochastic Games

We present a polynomial-time algorithm that always finds an (approximate) Nash equilibrium for repeated two-player stochastic games. The algorithm exploits the folk theorem to derive a strategy profi