Abstraction methods for game theoretic poker

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2063, Issue , 2001, Pages 333-345

  Shi, Jiefu ^a   Littman, Michael L ^b  

^a Duke University   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Game theory; Imperfect information games; Poker; Texas hold em

Indexed keywords

ABSTRACTING; GAME THEORY; STOCHASTIC SYSTEMS;

ABSTRACTION METHODS; COMBINATORIAL EXPLOSION; GAME-THEORETIC; IMPERFECT INFORMATION GAMES; MEDIUM SIZE; POKER;

COMPUTER GAMES;

EID: 0007901028     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45579-5_22     Document Type: Conference Paper

References (7)

1. Darse Billings, Denis Papp, Jonathan Schaeffer, and Duane Szafron. Opponent modeling in poker. In Proceedings of the 15th National Conference on Artificial Intelligence, pages 493-499, 1998.
2. Leslie Pack Kaelbling, Michael L. Littman, and Andrew W. Moore. Reinforcement learning: A survey. Journal of Artificial Intelligence Research, 4: 237-285, 1996.
3. Daphne Koller, Nimrod Megiddo, and Bernhard von Stengel. Efficient computation of equilibria for extensive two-person games. Games and Economic Behavior, 14(2): 247-259, 1996.
4. Daphne Koller and Avi Pfeffer. Representations and solutions for game-theoretic problems. Artificial Intelligence, 94(1-2): 167-215, 1997.
5. Avi Pfeffer, Daphne Koller, and Ken T. Takusagawa. State-space approximations for extensive form games. Workshop paper at First World Congress on Game Theory, 2000.
6. Richard S. Sutton and Andrew G. Barto. Reinforcement Learning: An Introduction. The MIT Press, 1998.
7. J. von Neumann and O. Morgenstern. Theory of Games and Economic Behavior. Princeton University Press, Princeton, NJ, 1947.