Computing an approximate jam/fold equilibrium for 3-player no-limit Texas hold'em tournaments

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

Volumn 2, Issue , 2008, Pages 901-908

  Ganzfried, Sam ^a   Sandholm, Tuomas ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Equilibrium finding; Game theory; Imperfect information; Poker; Stochastic games; Texas hold'em

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; GAME THEORY; MULTI AGENT SYSTEMS;

EQUILIBRIUM STRATEGY; HIGH LEVEL ALGORITHMS; IMPERFECT INFORMATION; IMPERFECT INFORMATION GAMES; POKER; STOCHASTIC GAME; TEXAS HOLD'EM; VALUE ITERATION;

ITERATIVE METHODS;

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

References (15)

1. J. Ankenman and B. Chen. The Mathematics of Poker. ConJelCo LLC, 2006.
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. B. Bollobâs. Combinatorics. Cambridge University Press, Cambridge, 1986.
4. X. Chen and X. Deng. Settling the complexity of 2-player Nash equilibrium. In Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS), 2006.
5. D. Fudenberg and D. Levine. The Theory of Learning in Games. MIT Press, 1998.
6. S. Ganzfried and T. Sandholm. Algorithms for multiplayer stochastic games of imperfect information with application to three-player no-limit Texas hold'em tournaments. Draft.
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 International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2007.
9. A. Gilpin and T. Sandholm. Lossless abstraction of imperfect information games. Journal of the ACM, 54(5), 2007.
10. A. Gilpin, T. Sandholm, and T. B. Sørensen. 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), 2007.
11. A. Gilpin, T. Sandholm, and T. B. Sorensen. 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.
12. HokTemResources.net. www.holdemresources.net/hr/sngs/icmcalculator.html.
13. P. B. Miltersen and T. B. Sørensen. A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament. In International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2007.
14. Sit-n-Go Power Tools, 2005. http: //www.sitngo-analyzer.com/
15. Two Plus Two Forums. Single table tournament forum FAQ, 2007. http://forumserver.twoplustwo.com/.