Approximating Game-Theoretical Optimal Strategies for Full-Scale Poker
- Darse Billings, Department of Computing Science, University of Alberta
- Neil Burch, Department of Computing Science, University of Alberta
- A. Davidson, Department of Computing Science, University of Alberta
- Robert Holte, Department of Computing Science, University of Alberta
- Jonathan Schaeffer, Department of Computing Science, University of Alberta
- Terence Schauenberg, Department of Computing Sciences, University of Alberta
- Duane Szafron, UofA CS
Citation
D. Billings, N. Burch, A. Davidson, R. Holte, J. Schaeffer, T. Schauenberg, D. Szafron. "Approximating Game-Theoretical Optimal Strategies for Full-Scale Poker". International Joint Conference on Artificial Intelligence (IJCAI), Acapulco, Mexico, pp 661-668, January 2003.Keywords: | full-scale, optimal, machine learning |
Category: | In Conference |
BibTeX
@incollection{Billings+al:IJCAI03, author = {Darse Billings and Neil Burch and A. Davidson and Robert Holte and Jonathan Schaeffer and Terence Schauenberg and Duane Szafron}, title = {Approximating Game-Theoretical Optimal Strategies for Full-Scale Poker}, Pages = {661-668}, booktitle = {International Joint Conference on Artificial Intelligence (IJCAI)}, year = 2003, }Last Updated: June 04, 2007
Submitted by Staurt H. Johnson