A new algorithm for generating equilibria in massive zero-sum games

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 788-793

  Zinkevich, Martin ^a   Bowling, Michael ^a   Burch, Neil ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY;

BANKROLL COMPETITION; GAME COMPLEXITY; ZERO-SUM GAMES;

GAME THEORY;

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

References (16)

1. 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 International Joint Conference on Artificial Intelligence, 661-668.
2. Billings, D.; Davidson, A.; Schauenberg, T.; Burch, N.; Bowling, M.; Holte, R.; and Schaeffer, J. 2004. Game tree search with adaptation in stochastic imperfect information games. In Computer and Games.
3. Dantzig, G., and Wolfe, P. 1960. Decomposition principle for linear programs. Operations Research 8:101-111.
4. Gilmore, P., and Gomory, R. 1960. A linear programming approach to the cutting stock problem. Operations Research 849-859.
5. Gilpin, A., and Sandholm, T. 2006. A competitive texas hold'em poker player via automated abstraction and realtime equilibrium computation. In National Conference on Artificial Intelligence.
6. Grotschel, M.; Lovasz, L.; and Schrijver, A. 1988. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag.
7. Hsu, F. H. 2002. Behind Deep Blue: Building the Computer that Defeated the World Chess Champion. Princeton University Press.
8. Koller, D., and Megiddo, N. 1992. The complexity of two-person zero-sum games in extensive form. Games and Economic Behavior 528-552.
9. Koller, D.; Megiddo, N.; and von Stengel, B. 1994. Fast algorithms for finding randomized strategies in game trees. 750-759.
10. Lemke, C., and Howson, J. 1964. Equilibrium points of bimatrix games. Journal of the Society of Industrial and Applied Mathematics 413-423.
11. McMahan, H.; Gordon, G.; and Blum, A. 2003. Planning in the presence of cost functions controlled by an adversary. In International Conference on Machine Learning.
12. Méro, L., and Mészáros, V. 1990. Ways of Thinking: The Limits of Rational Thought and Artificial Intelligence. World Scientific.
13. Romanovskii, I. V. 1962. Reduction of a game with complete memory to a matrix game. Soviet Mathematics 678-681. (English translation of Doklady Akademii Nauk SSSR 1444,62-64.).
14. Samuel, A. L. 1959. Some studies in machine learning using the game of checkers. IBM Journal on Research and Development 210-229.
15. Schaeffer, J.; Björnsson, Y.; Burch, N.; Lake, R.; Lu, P.; and Sutphen, S. 2003. Building the checkers 10-piece endgame databases. Advances in Computer Games 10 193-210.
16. Zinkevich, M., and Littman, M. 2006. The aaai computer poker competition. Journal of the International Computer Games Association 29. News item.