Action translation in extensive-form games with large action spaces: Axioms, paradoxes, and the pseudo-harmonic mapping

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2013, Pages 120-128

  Ganzfried, Sam ^a   Sandholm, Tuomas ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION SPACES; EXTENSIVE-FORM GAMES; IMPROVE PERFORMANCE; OPTIMAL ACTIONS; TEXAS HOLD'EM; WORST-CASE PERFORMANCE;

ABSTRACTING; ARTIFICIAL INTELLIGENCE;

MAPPING;

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

References (19)

1. Rickard Andersson. Pseudo-optimal strategies in no-limit poker. Master's thesis, Umeå University, May 2006.
2. Jerrod Ankenman and Bill Chen. The Mathematics of Poker. ConJelCo LLC, 2006.
3. C. Archibald and Y. Shoham. Modeling billiards games. In International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), Budapest, Hungary, 2009.
4. Darse Billings, Neil Burch, Aaron Davidson, Robert Holte, Jonathan Schaeffer, Terence Schauenberg, and Duane Szafron. Approximating gametheoretic optimal strategies for full-scale poker. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), 2003.
5. Sam Ganzfried and Tuomas 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.
6. Sam Ganzfried, Tuomas Sandholm, and Kevin Waugh. Strategy purification and thresholding: Effective non-equilibrium approaches for playing large games. In International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2012.
7. Andrew Gilpin and Tuomas 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. Andrew Gilpin, Tuomas Sandholm, and Troels Bjerre S?rensen. A heads-up no-limit Texas Hold'em poker player: Discretized betting models and automatically generated equilibrium-finding programs. In International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2008.
9. John Hawkin, Robert Holte, and Duane Szafron. Automated action abstraction of imperfect information extensive-form games. In Proceedings of the National Conference on Artificial Intelligence (AAAI), 2011.
10. John Hawkin, Robert Holte, and Duane Szafron. Using sliding windows to generate action abstractions in extensive-form games. In Proceedings of the National Conference on Artificial Intelligence (AAAI), 2012.
11. Samid Hoda, Andrew Gilpin, Javier Peña, and Tuomas Sandholm. Smoothing techniques for computing Nash equilibria of sequential games. Mathematics of Operations Research, 35(2):494-512, 2010.
12. Michael Johanson. Measuring the size of large no-limit poker games. Technical Report TR13-01, Department of Computing Science, University of Alberta, 2013.
13. H. W. Kuhn. Simplified two-person poker. In H. W. Kuhn and A. W. Tucker, editors, Contributions to the Theory of Games, volume 1 of Annals of Mathematics Studies, 24, pages 97-103. Princeton University Press, Princeton, New Jersey, 1950.
14. Jonathan Rubin and Ian Watson. Case-based strategies in computer poker. AI Communications, 25(1):19-48, 2012.
15. Tuomas Sandholm. The state of solving large incomplete-information games, and application to poker. AI Magazine, pages 13-32, Winter 2010. Special issue on Algorithmic Game Theory.
16. David Schnizlein, Michael Bowling, and Duane Szafron. Probabilistic state translation in extensive games with large action sets. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI), 2009.
17. Kevin Waugh, David Schnizlein, Michael Bowling, and Duane Szafron. Abstract: ion pathologies in extensive games. In International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2009.
18. Michael Wellman. Methods for empirical game-theoretic analysis (extended abstract). In Proceedings of the National Conference on Artificial Intelligence (AAAI), pages 1552-1555, 2006.
19. Martin Zinkevich, Michael Bowling, Michael Johanson, and Carmelo Piccione. Regret minimization in games with incomplete information. In Proceedings of the Annual Conference on Neural Information Processing Systems (NIPS), 2007.