29 citations · 40 across the 2 of their papers we have counts for
2 papers
cs.GT2012★ 29 cited
A Polynomial-time Nash Equilibrium Algorithm for Repeated Stochastic Games
Enrique Munoz de Cote, Michael L. Littman
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 deri…
cs.GT2012★ 11 cited
Automated Planning in Repeated Adversarial Games
Enrique Munoz de Cote, Archie C. Chapman, Adam M. Sykulski +1
Game theory's prescriptive power typically relies on full rationality and/or self-play interactions. In contrast, this work sets aside these fundamental premises and focuses instea…