Expectation-based versus potential-aware automated abstraction in imperfect information games: An experimental comparison using poker

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2008, Pages 1454-1457

  Gilpin, Andrew ^a   Sandholm, Tuomas ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; AGENTS; ARTIFICIAL INTELLIGENCE; AUTOMATION; BIONICS; PROBABILITY; PROBABILITY DISTRIBUTIONS; REAL TIME SYSTEMS;

ABSTRACTION ALGORITHMS; COMPETITIVE GAMES; EXPERIMENTAL COMPARISONS; FINDING ALGORITHMS; IMPERFECT INFORMATIONS; KEY COMPONENTS; OPTIMAL STRATEGIES; RELATIVE PERFORMANCES; RHODE ISLANDS; SIMILARITY MEASURES; SYSTEMATIC EVALUATIONS;

GAME THEORY;

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

References (13)

1. Billings, D.; Davidson, A.; Schaeffer, J.; and Szafron, D. 2002. The challenge of poker. Artificial Intelligence 134(1-2):201-240. Gilpin, A., and Sandholm, T. 2007a. Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker. In AAMAS'08.
2. Gilpin, A., and Sandholm, T. 2007b. Lossless abstraction of imperfect information games. Journal of the ACM 54(5).
3. Gilpin, A.; Hoda, S.; Peña, J.; and Sandholm, T. 2007. Gradient-based algorithms for finding Nash equilibria in extensive form games. In WINE'07.
4. Gilpin, A.; Peña, J.; and Sandholm, T. 2008. First-order algorithm with O(log(1/e)) convergence for e-equilibrium in games. In AAAI'08.
5. Gilpin, A.; Sandholm, T.; and Sørensen, T. B. 2007. Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of Texas Hold'em poker. In AAAl'07.
6. Gilpin, A.; Sandholm, T; and SØrensen, T. B. 2008. A heads-up no-limit Texas Hold'em poker player: Discretized betting models and automatically generated equilibrium-finding programs. In AAMAS'08.
7. Hoda, S.; Gilpin, A.; and PenØa, J. 2007. A gradient-based approach for computing Nash equilibria of large sequential games. Available at http://www.optimization-online.org/.
8. Koller, D., and Megiddo, N. 1992. The complexity of two-person zero-sum games in extensive form. Games and Economic Behavior 4(4):528-552.
9. McMahan, H. B., and Gordon, G. J. 2007. A fast bundle-based anytime algorithm for poker and other convex games. In 11th Int. Conf. on Artificial Intelligence and Statistics (AISTATS). Romanovskii, I. 1962. Reduction of a game with complete memory to a matrix game. Soviet Mathematics 3:678-681.
10. Shi, J., and Littman, M. 2002. Abstraction methods for game theoretic poker. In CG '00: Revised Papers from the Second International Conference on Computers and Games, 333-345.
11. von Stengel, B. 1996. Efficient computation of behavior strategies. Games and Economic Behavior 14(2):220-246.
12. Zinkevich, M.; Bowling, M.; Johanson, M.; and Piccione, C. 2007. Regret minimization in games with incomplete information. In NIPS'O7.
13. Zinkevich, M.; Bowling, M.; and Burch, N. 2007. A new algorithm for generating equilibria in massive zero-sum games. In AAAI'07.