PAIR Lab: PKU Alignment and Interaction Research Lab
PAIR Lab: PKU Alignment and Interaction Research Lab
Open-Source Projects
People
Talks
Publications
Resources
Contact
PPAD-Completeness
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.
Xiaotie Deng
,
Ningyuan Li
,
David Mguni
,
Jun Wang
,
Yaodong Yang
PDF
Cite
Cite
×