A fast bundle-based anytime algorithm for poker and other convex games

Journal of Machine Learning Research

Volumn 2, Issue , 2007, Pages 323-330

  McMahan, H Brendan ^a   Gordon, Geoffrey J ^b  

^a GOOGLE INC   (United States)

^b Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANYTIME ALGORITHM; CONVEX GAME; EXACT MINIMIZATION; EXTENSIVE-FORM GAMES; LINE SEARCHES; LINEAR PROGRAMMING ALGORITHM; NATURAL GENERALIZATION; SEARCH DIRECTION; STRATEGIC INTERACTIONS; TEXAS HOLD'EM;

ARTIFICIAL INTELLIGENCE;

ALGORITHMS;

EID: 84862283667     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (14)

1. Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Räcke. Optimal oblivious routing in polynomial time. In Proc. of ACM Symposium on the Theory of Computation, 2003.
2. D. Billings, N. Burch, A. Davidson, R. Holte, J. Schaeffer, T. Schauenberg, and D. Szafron. Approximating game-theoretic optimal strategies for full-scale poker. In IJCAI, 2003.
3. Brent Bryan, H. Brendan McMahan, Chad M. Schafer, and Jeff Schneider. Efficiently computing minimax expectedsize confidence regions. Under review, 2007.
4. M. Dresher and S. Karlin. Solutions of convex games as fixed-points. In H. W. Kuhn and A.W. Tucker, editors, Contributions To The Theory of Games: Volume 2, number 28 in Annals of Mathematics Studies, pages 75-86. Princeton University Press, 1953.
5. Andrew Gilpin and Tuomas Sandholm. Optimal rhode island hold'em poker. In AAAI, pages 1684-1685, 2005.
6. Andrew Gilpin and Tuomas Sandholm. A texas hold'em poker player based on automated abstraction and realtime equilibrium computation. In AAMAS 06, 2006.
7. Geoffrey J. Gordon. No-regret algorithms for structured prediction problems. Technical Report CMU-CALD-05-112, Carnegie Mellon University, 2005.
8. J.-B. Hiriart-Urruty and C. Lemaréchal. Convex Analysis and Minimization Algorithms. Springer Verlag-Heidelberg, 1993. Two volumes.
9. Adam Kalai and Santosh Vempala. Efficient algorithms for online optimization. In COLT, 2003.
10. D. Koller and N. Megiddo. The complexity of two-person zero-sum games in extensive form. Games and Economic Bahavior, 4(4):528-552, 1992.
11. Daphne Koller, Nimrod Megiddo, and Bernhard von Stengel. Fast algorithms for finding randomized strategies in game trees. In STOC, 1994.
12. David S. Leslie and E.J. Collins. Generalised weakened fictitious play. Games and Economic Behavior, 56(2): 285-298, August 2006.
13. H. Brendan McMahan, Geoffrey J. Gordon, and Avrim Blum. Planning in the presence of cost functions controlled by an adversary. In ICML 2003, 2003.
14. Hugh Brendan McMahan. Robust Planning in Domains with Stochastic Outcomes, Adversaries, and Partial Observability. PhD thesis, Carnegie Mellon University, December 2006.