Computing equilibria in multiplayer stochastic games of imperfect information

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 140-146

  Ganzfried, Sam ^a   Sandholm, Tuomas ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER GAMES; GAME THEORY;

COMPUTING EQUILIBRIA; EQUILIBRIUM STRATEGY; EXTERNAL REGRETS; IMPERFECT INFORMATION; NASH EQUILIBRIA; NON EQUILIBRIUM; ORIGINAL ALGORITHMS; STOCHASTIC GAME;

STOCHASTIC SYSTEMS;

EID: 78649846226     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. D. Billings, N. Burch, A. Davidson, R. Holte, J. Schaeffer, T. Schauenberg, and D. Szafron. Approximating game-theoretic optimal strategies for full-scale poker. IJCAI, 2003.
2. R. Brafman and M. Tennenholtz. Learning to coordinate efficiently: A model-based approach. JAIR, 2003.
3. X. Chen and X. Deng. Settling the complexity of 2-player Nash equilibrium. FOCS, 2006.
4. D. Fudenberg and D. Levine. The Theory of Learning in Games. MIT Press, 1998.
5. S. Ganzfried and T. Sandholm. Computing an approximate jam/fold equilibrium for 3-agent no-limit Texas hold'em tournaments. AAMAS, 2008.
6. A. Gilpin and T. Sandholm. A competitive Texas Hold'em poker player via automated abstraction and real-time equilibrium computation. AAAI, 2006.
7. A. Gilpin, T. Sandholm, and T. B. Sørensen. A heads-up no-limit Texas Hold'em poker player: Discretized betting models and automatically generated equilibrium-finding programs. AAMAS, 2008.
8. J. Hu and M. Wellman. Nash Q-learning for general-sum stochastic games. JMLR, 2003.
9. A. Kalai and S. Vempala. Efficient algorithms for online decision problems. Journal of Computer and System Sciences, 2005.
10. M. Kearns, Y. Mansour, and S. Singh. Fast planning in stochastic games. UAI, 2000.
11. M. Littman. Friend-or-foe Q-learning in general-sum Markov games. ICML, 2001.
12. P. B. Miltersen and T. B. Sørensen. A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament. AAMAS, 2007.
13. M. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming.Wiley&Sons, 2005.
14. X. Wang and T. Sandholm. Reinforcement learning to play an optimal Nash equilibrium in team Markov games. NIPS, 2002.
15. M. Zinkevich, M. Bowling, M. Johanson, and C. Piccione. Regret minimization in games with incomplete information. NIPS, 2007.