Using counterfactual regret minimization to create competitive multiplayer poker agents

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 1, Issue , 2010, Pages 159-166

  Risk, Nick Abou ^a   Szafron, Duane ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Abstraction; Computer Poker; Counterfactual Regret Minimization; Equilibrium; Game Theory

Indexed keywords

AUTONOMOUS AGENTS; MULTI AGENT SYSTEMS; PHASE EQUILIBRIA;

ABSTRACTION; ARTIFICIAL INTELLIGENCE TECHNIQUES; DETERMINISTIC GAMES; IMPERFECT INFORMATION; NASH EQUILIBRIUM STRATEGIES; PERFECT INFORMATIONS; REGRET MINIMIZATION; THEORETICAL GUARANTEES;

GAME THEORY;

EID: 79953170325     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Billings, D., Burch, N., Davidson, A., Holte, R., Schaeffer, J., Schauenberg, T. and Szafron, D. 2003. Approximating game-theoretic optimal strategies for full-scale poker. IJCAI.
2. Ganzfried, S. and Sandholm, T. 2008. Computing an approximate jam/fold equilibrium for 3-agent no-limit texas hold'em tournaments. AAMAS.
3. Ganzfried, S. and Sandholm, T. 2009. Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information. IJCAI.
4. Gilpin, A., Hoda, S., Pena, J. and Sandholm, T. 2007. Gradient-based algorithms for finding nash equilibria in extensive form games. Workshop on Internet and Network Economics, (WINE), LNCS 4858.
5. Gilpin, A., Sandholm, T. and Sorensen, T.B. 2008. A heads-up no-limit texas hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs. AAMAS.
6. Gilpin, A., Sandholm, T. and Sorensen, T.B. 2007. Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of Texas Hold'em poker. AAAI.
7. Hamilton, C. 2008. AAAI Third Annual Computer Poker Competition. AI Magazine - AAAI News, 29 (1).
8. Johanson, M.B. 2007. Robust strategies and counter-strategies: Building a champion level computer poker player. MSc thesis, University of Alberta, Edmonton.
9. Koller, D., Megiddo, N. and Von Stengel, B. 1996. Efficient computation of equilibria for extensive two-person games. Games and Economic Behavior, 14(2).
10. Koller, D. and Pfeffer, A. 1997. Representations and solutions for game-theoretic problems. Artificial Intelligence, 94.
11. Kuhn, H.W. 1950. A simplified two-person poker. Contributions to the Theory of Games, 1.
12. Nash, J.F. 1950. Equilibrium points in n-person games. National Academy of Sciences of the USA.
13. Osborne, M. and Rubenstein, A. 1994. A Course in Game Theory. The MIT Press.
14. Schnizlein, D., Bowling, M. and Szafron, D. 2009. Probabilistic state translation in extensive games with large action sets. IJCAI.
15. The Second Man-Machine Poker Competition. http://poker.cs.ualberta.ca/ man-machine/.
16. Southey, F., Bowling, M., Larson, B., Piccione, C, Burch, N., Billings, D. and Rayner, C. 2005. Bayesbluff: Opponent modelling in poker. UAI.
17. Waugh, K., Schnizlein, D., Bowling, M. and Szafron, D. 2009. Abstraction pathology in extensive games. AMMAS.
18. Zinkevich, M., Johanson, M., Bowling, M. and Piccione, C. 2008. Regret minimization in games with incomplete information. NIPS.