Markov Game

On the complexity of computing Markov perfect equilibrium in general-sum stochastic games
We introduce approximate Markov perfect equilibrium as a solution to the computational problem of finite-state stochastic games repeated in the infinite horizon and prove its PPAD-completeness.
PDF Cite