Using fictitious play to find pseudo-optimal solutions for full-scale poker

Proceedings of the 2006 International Conference on Artificial Intelligence, ICAI'06

Volumn 2, Issue , 2006, Pages 374-380

  Dudziak, William ^a  

^a The University of Akron   (United States)

Author keywords

Fictitious play; Game theory; Game tree reduction; Nash equilibrium; Poker

Indexed keywords

ABSTRACTION TECHNIQUES; FICTITIOUS PLAY; GAME TREES; NASH EQUILIBRIA; POKER; TECHNIQUES USED; TERMINAL NODES; TEXAS HOLD'EM;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; FORESTRY; GAME THEORY; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

OPTIMAL SYSTEMS;

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

References (2)

1. Brown, G.W. Iterative Solutions of Games by Fictitious Play. In Activity Analysis of Production and Allocation, T.C. Koopmans (Ed.). New York: Wiley.
2. D. Billings, N. Burch, A. Davidson, R. Holfe, J. Schaeffer, T. Schauenberg, and D. Szafron. Approximating Game-Theoretic Optimal Strategies for Full-scale Poker. Proceedings of the 2003 International Joint Conference on Artificial Intelligence.