560 citations · 3.3k across the 60 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2013★ 560 cited
Graphical Models for Game Theory
Michael Kearns, Michael L. Littman, Satinder Singh
In this work, we introduce graphical modelsfor multi-player game theory, and give powerful algorithms for computing their Nash equilibria in certain cases. An n-player game is give…
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…