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