Improving performance in imperfect-information games with large state and action spaces by solving endgames

AAAI Workshop - Technical Report

Volumn WS-13-08, Issue , 2013, Pages 22-29

  Ganzfried, Sam ^a   Sandholm, Tuomas ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; FORESTRY; PROBABILITY DISTRIBUTIONS; TREES (MATHEMATICS);

ABSTRACTION ALGORITHMS; ABSTRACTION TECHNIQUES; BACKWARD INDUCTION; EQUILIBRIUM REFINEMENTS; EQUILIBRIUM STRATEGY; IMPROVING PERFORMANCE; PERFECT INFORMATIONS; SEQUENTIAL GAMES;

ABSTRACTING;

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

References (25)

1. Ankenman, J., and Chen, B. 2006. The Mathematics of Poker. ConJelCo LLC.
2. Annual Computer Poker Competition. http://www.computerpokercompetition. org/.
3. Arthur, D., and Vassilvitskii, S. 2007. k-means++: The advantages of careful seeding. In SODA.
4. 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. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI).
5. Ganzfried, S., and Sandholm, T. 2010. Computing equilibria by incorporating qualitative models. In International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS).
6. Ganzfried, S., and Sandholm, T. 2012. Tartanian5: A heads-up no-limit Texas Hold'em poker-playing program. In Computer Poker Symposium at the National Conference on Artificial Intelligence (AAAI).
7. Ganzfried, S., and Sandholm, T. 2013. 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).
8. Ganzfried, S.; Sandholm, T.; and Waugh, K. 2012. Strategy purification and thresholding: Effective non-equilibrium approaches for playing large games. In International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS).
9. Gibson, R., and Szafron, D. 2011. On strategy stitching in large extensive form multiplayer games. In Proceedings of the Annual Conference on Neural Information Processing Systems (NIPS).
10. Gilpin, A., and Sandholm, T. 2006. A competitive Texas Hold'em poker player via automated abstraction and realtime equilibrium computation. In Proceedings of the National Conference on Artificial Intelligence (AAAI).
11. Gilpin, A.; Sandholm, T.; and Sprensen, T. B. 2007. Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of Texas Hold'em poker. In Proceedings of the National Conference on Artificial Intelligence (AAAI).
12. Gordon, G. One-card poker. http://www.cs.cmu.edu/~ggordon/poker/.
13. Hoda, S.; Gilpin, A.; Pena, J.; and Sandholm, T. 2010. Smoothing techniques for computing Nash equilibria of sequential games. Mathematics of Operations Research 35(2):494-512.
14. Johanson, M.; Burch, N.; Valenzano, R.; and Bowling, M. 2013. Evaluating state-space abstractions in extensive-form games. In Autonomous Agents and Multi-Agent Systems.
15. Johanson, M. 2013. Measuring the size of large no-limit poker games. Technical Report TR13-01, Department of Computing Science, University of Alberta.
16. Koller, D.; Megiddo, N.; and von Stengel, B. 1994. Fast algorithms for finding randomized strategies in game trees. In Proceedings of the 26th ACM Symposium on Theory of Computing (STOC).
17. Miltersen, P. B., and Sprensen, T. B. 2008. Fast algorithms for finding proper strategies in game trees. In Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
18. Miltersen, P. B., and Sprensen, T. B. 2010. Computing a quasi-perfect equilibrium of a two-player game. Economic Theory 42(1):175-192.
19. Nash, J. 1951. Non-cooperative games. Annals of Mathematics 54:289-295.
20. Sandholm, T. 2010. The state of solving large incomplete-information games, and application to poker. AI Magazine 13-32. Special issue on Algorithmic Game Theory.
21. Schnizlein, D.; Bowling, M.; and Szafron, D. 2009. Probabilistic state translation in extensive games with large action sets. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI).
22. van Damme, E. 1987. Stability and Perfection of Nash Equilibrium. Springer-Verlag.
23. von Neumann, J., and Morgenstern, O. 1947. Theory of Games and Economic Behavior. Princeton University Press.
24. Waugh, K.; Bard, N.; and Bowling, M. 2009. Strategy grafting in extensive games. In Proceedings of the Annual Conference on Neural Information Processing Systems (NIPS).
25. Zinkevich, M.; Bowling, M.; Johanson, M.; and Piccione, C. 2007. Regret minimization in games with incomplete information. In Proceedings of the Annual Conference on Neural Information Processing Systems (NIPS).