Adaptive play in Texas hold’em poker

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 458-462

  Maîtrepierre, Raphaël ^a   Mary, Jérémie ^a   Munos, Rémi ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

BEST DECISION; BOUND ALGORITHMS; CHANGE POINT DETECTION; EXPLORATION/EXPLOITATION; GAME TREES; NASH EQUILIBRIUM COMPUTATIONS; TEXAS HOLD'EM; UPPER CONFIDENCE BOUND;

FORESTRY;

EID: 84868297032     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-458     Document Type: Conference Paper

References (16)

1. J.Y. Audibert, R. Munos, and C. Szepesvári. Use of variance estimation in the multi-armed bandit problem. NIPS Workshop on on-line trading of exploration and exploitation, Vancouver, 2006.
2. Peter Auer, Nicolò Cesa-Bianchi, and Paul Fischer, ‘Finite-time analysis of the multiarmed bandit problem’, Machine Learning, 47(2/3), 235–256, (2002).
3. D. Billings, ‘The first international roshambo programming competition’, The International Computer Games Association Journal, 1(23), 42–50, (2000).
4. D. Billings, ‘Thoughts on roshambo’, The International Computer Games Association Journal, 1(23), 3–8, (2000).
5. D. Billings, N. Burch, A. Davidson, R. Holte, J. Schaeffer, T. Schauenberg, and D. Szafron. Approximating game-theoretic optimal strategies for full-scale poker, 2003.
6. D. Billings, A. Davidson, T. Schauenberg, N. Burch, M. Bowling, R. Holte, J. Schaeffer, and D. Szafron, ‘Game-tree search with adaptation in stochastic imperfect-information games’, Computers and Games: 4th International Conference, 21–34, (2004).
7. Darse Billings, Aaron Davidson, Jonathan Schaeffer, and Duane Szafron, ‘The challenge of poker’, Artificial Intelligence, 134(1-2), 201–240, (2002).
8. Darse Billings, Lourdes Pena, Jonathan Schaeffer, and Duane Szafron, ‘Using probabilistic knowledge and simulation to play poker’, in AAAI/IAAI, pp. 697–703, (1999).
9. Doyle Brunson, Super System: A Course in Power Poker,, Cardoza Publishing, 1979.
10. Murray Campbell, A. Joseph Hoane Jr., and Feng hsiung Hsu, ‘Deep blue’, Artificial Intelligence, 134, 57–83, (2002).
11. Andrew Gilpin and Tuomas Sandholm, ‘Finding equilibria in large sequential games of imperfect information’, in EC’06: Proceedings of the 7th ACM conference on Electronic commerce, pp. 160–169, New York, NY, USA, (2006). ACM.
12. Andrew Gilpin and Tuomas Sandholm, ‘Better automated abstraction techniques for imperfect information games, with application to texas hold’em poker’, in AAMAS’07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, pp. 1–8, New York, NY, USA, (2007). ACM.
13. J. F. Nash. Equilibrium points in n-person games, 1950.
14. J. Schaeffer and R. Lake. Solving the game of checkers, 1996.
15. A. Selby. Optimal strategy for heads-up limit holdem.
16. Martin Zinkevich, Michael Johanson, Michael Bowling, and Carmelo Piccione, ‘Regret minimization in games with incomplete information’, in Advances in Neural Information Processing Systems 20, eds., J.C. Platt, D. Koller, Y. Singer, and S. Roweis, MIT Press, Cambridge, MA, (2008).