A competitive Texas Hold'em poker player via automated abstraction and real-time equilibrium computation

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2006, Pages 1007-1013

  Gilpin, Andrew ^a   Sandholm, Tuomas ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED ABSTRACTION; DOMAIN KNOWLEDGE; LINEAR PROGRAMS; STRATEGY COMPUTATIONS;

ABSTRACTING; APPROXIMATION THEORY; COMPUTATION THEORY; LINEAR PROGRAMMING; PROBABILITY;

GAME THEORY;

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

References (27)

1. Bellman, R., and Blackwell, D. 1949. Some two-person games involving bluffing. Proc. of the National Academy of Sciences 35:600-605.
2. Billings, D.; Davidson, A.; Schaeffer, J.; and Szafron, D. 2002. The challenge of poker. Artificial Intelligence 134(1-2):201-240.
3. Billings, D.; Burch, N.; Davidson, A.; Holte, R.; Schaeffer, J.; Schauenberg, T.; and Szafron, D. 2003. Approximating game-theoretic optimal strategies for full-scale poker. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI).
4. Billings, D.; Bowling, M.; Burch, N.; Davidson, A.; Holte, R.; Schaeffer, J.; Schauenberg, T.; and Szafron, D. 2004. Game tree search with adaptation in stochastic imperfect information games. In Computers and Games. Springer-Verlag.
5. Billings, D. 2005. Web posting at Poker Academy Forums, Meerkat API and AI Discussion. http://www.poker-academy.com/forums/viewtopic.php?t=1872.
6. Bollobás, B. 1986. Combinatorics. Cambridge University Press.
7. Davidson, A. 2005. Web posting at Poker Academy Forums, General. http://www.poker-academy.com/forums/viewtopic.php?t=426.
8. Gilpin, A., and Sandholm, T. 2005. Finding equilibria in large sequential games of imperfect information. Technical Report CMU-CS-05-158, Carnegie Mellon University. To appear in Proceedings of the ACM Conference on Electronic Commerce, 2006.
9. Ginsberg, M. L. 1996. Partition search. In Proceedings of the National Conference on Artificial Intelligence (AAAI), 228-233.
10. Ginsberg, M. L. 1999. GIB: Steps toward an expert-level bridge-playing program. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI).
11. Hoehn, B.; Southey, F.; Holte, R. C.; and Bulitko, V. 2005. Effective short-term opponent exploitation in simplified poker. In Proceedings of the National Conference on Artificial Intelligence (AMI), 783-788.
12. Knoblock, C. A. 1994. Automatically generating abstractions for planning. Artificial Intelligence 68(2):243-302.
13. Koller, D., and Pfeffer, A. 1997. Representations and solutions for game-theoretic problems. Artificial Intelligence 94(1):167-215.
14. Koller, D.; Megiddo, N.; and von Stengel, B. 1996. Efficient computation of equilibria for extensive two-person games. Games and Economic Behavior 14(2):247-259.
15. Kreps, D. M., and Wilson, R. 1982. Sequential equilibria. Econometrica 50(4):863-894.
16. Kuhn, H. W. 1950a. Extensive games. Proc. of the National Academy of Sciences 36:570-576.
17. Kuhn, H. W. 1950b. A simplified two-person poker. In Kuhn, H. W., and Tucker, A. W., eds., Contributions to the Theory of Games, volume 1 of Annals of Mathematics Studies, 24. Princeton University Press. 97-103.
18. Liu, C.-L., and Wellman, M. 1996. On state-space abstraction for anytime evaluation of Bayesian networks. SIGART Bulletin 7(2):50-57. Special issue on Anytime Algorithms and Deliberation Scheduling.
19. Miltersen, P. B., and Sørensen, T. B. 2006. Computing sequential equilibria for two-player games. In Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 107-116.
20. Nash, J. F., and Shapley, L. S. 1950. A simple three-person poker game. In Kuhn, H. W., and Tucker, A. W., eds., Contributions to the Theory of Games, volume 1. Princeton University Press. 105-116.
21. Romanovskii, I. 1962. Reduction of a game with complete memory to a matrix game. Soviet Mathematics 3:678-681.
22. Selby, A. 1999. Optimal heads-up preflop poker. http://www.archduke. demon.co.uk/simplex/.
23. Shi, J., and Littman, M. 2001. Abstraction methods for game theoretic poker. In Computers and Games, 333-345. Springer-Verlag.
24. Smith, S. J. J.; Nau, D. S.; and Throop, T. 1998. Computer bridge: A big win for AI planning. AI Magazine 19(2):93-105.
25. Southey, F.; Bowling, M.; Larson, B.; Piccione, C.; Burch, N.; Billings, D.; and Rayner, C. 2005. Bayes' bluff: Opponent modelling in poker. In Proceedings of the 21st Annual Conference on Uncertainty in Artificial Intelligence (UAI), 550-558.
26. von Neumann, J., and Morgenstern, O. 1947. Theory of games and economic behavior. Princeton University Press.
27. von Stengel, B. 1996. Efficient computation of behavior strategies. Games and Economic Behavior 14(2):220-246.