Endgame solving in large imperfect-information games

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

Volumn 1, Issue , 2015, Pages 37-45

  Ganzfried, Sam ^a   Sandholm, Tuomas ^a  

^a Computer Science Department Carnegie Mellon University ^*  (United States)

Author keywords

Game Solving; Game Theory; Imperfect Information

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; COMPUTATION THEORY; GAME THEORY; MULTI AGENT SYSTEMS; SOFTWARE AGENTS; TABLE LOOKUP;

DEGREE OF ACCURACY; GAME PLAYS; GAME SOLVING; GAME-THEORETIC; IMPERFECT INFORMATION; IMPERFECT INFORMATION GAMES; TEXAS HOLD'EM; VARIANCE REDUCTION TECHNIQUES;

COMPUTER GAMES;

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

References (21)

1. R. E. Bellman. On the application of dynamic programming to the determination of optimal play in chess and checkers. National Academy of Sciences of the United States of America, 53:244-247, 1965.
2. D. Billings, N. Burch, A. Davidson, R. Holte, J. Schaeffer, T. Schauenberg, and D. Szafron. Approximating game-theoretic optimal strategies for full-scale poker. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), 2003.
3. N. Burch, M. Johanson, and M. Bowling. Solving imperfect information games using decomposition. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2014.
4. S. Ganzfried and T. Sandholm. Tartanian5: A heads-up no-limit Texas Hold'em poker-playing program. In Computer Poker Symposium at the National Conference on Artificial Intelligence (AAAI) 2012.
5. S. Ganzfried and T. Sandholm. Action translation in extensive-form games with large action spaces: Axioms, paradoxes, and the pseudo-harmonic mapping. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 2013.
6. S. Ganzfried, T. Sandholm, and K. Waugh. Strategy purification and thresholding: Effective non-equilibrium approaches for playing large games. In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2012.
7. A. Gilpin and T. Sandholm. A competitive Texas Hold'em poker player via automated abstraction and real-time equilibrium computation. In Proceedings of the National Conference on Artificial Intelligence (AAAI), 2006.
8. A. Gilpin and T. Sandholm. Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker. In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2007.
9. I. Gurobi Optimization. Gurobi optimizer reference manual, 2014.
10. S. Hoda, A. Gilpin, J. Peña, and T. Sandholm. Smoothing techniques for computing Nash equilibria of sequential games. Mathematics of Operations Research, 35(2):494-512, 2010.
11. E. Jackson. A time and space efficient algorithm for approximately solving large imperfect information games. In AAAI Workshop on Computer Poker and Incomplete Information, 2014.
12. M. Johanson. Measuring the size of large no-limit poker games. Technical report, University of Alberta, 2013.
13. M. Johanson, N. Burch, R. Valenzano, and M. Bowling. Evaluating state-space abstractions in extensive-form games. In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2013.
14. D. Roller, N. Megiddo, and B. von Stengel. Fast algorithms for finding randomized strategies in game trees. In Proceedings of the 26th ACM Symposium on Theory of Computing (STOC), pages 750-760, 1994.
15. P. B. Miltersen and T. B. Sørensen. Computing proper equilibria of zero-sum games. In Computers and Games, pages 200-211, 2006.
16. P. B. Miltersen and T. B. Sørensen. Fast algorithms for finding proper strategies in game ttrees. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 874-883, 2008.
17. P. B. Miltersen and T. B. Sørensen. Computing a quasi-perfect equilibrium of a two-player game. Economic Theory, 42(1):175-192, 2010.
18. J. Schaeffer, Y. Bjornsson, N. Burch, R. Lake, P. Lu, and S. Sutphen. Building the checkers 10-piece endgame databases. In Advances in Computer Games 10, 2003.
19. D. Schnizlein, M. Bowling, and D. Szafron. Probabilistic state translation in extensive games with large action sets. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 2009.
20. K. Waugh, M. Zinkevich, M. Johanson, M. Kan, D. Schnizlein, and M. Bowling. A practical use of imperfect recall. In Proceedings of the Symposium on Abstraction, Reformulation and Approximation (SARA), 2009.
21. M. Zinkevich, M. Bowling, M. Johanson, and C. Piccione. Regret minimization in games with incomplete information. In Proceedings of the Annual Conference on Neural Information Processing Systems (NIPS), 2007.