Lossless abstraction of imperfect information games (2007)

Cached

Download Links

by Andrew Gilpin , Tuomas Sandholm
Venue:Journal of the ACM
Citations:21 - 9 self

Documents Related by Co-Citation

127 Approximating Game-Theoretic Optimal Strategies for Full-scale Poker – D. Billings, N. Burch, A. Davidson, R. Holte, J. Schaeffer, T. Schauenberg, D. Szafron - 2003
37 Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of Texas Hold’em poker – Andrew Gilpin, Tuomas Sandholm, Troels Bjerre Sørensen - 2007
45 A competitive Texas Hold’em poker player via automated abstraction and realtime equilibrium computation – Andrew Gilpin, Tuomas Sandholm - 2006
24 A heads-up no-limit Texas Hold’em poker player: Discretized betting models and automatically generated equilibriumfinding programs – A Gilpin, T Sandholm, T B Sorensen - 2008
35 Abstraction methods for game theoretic poker – J Shi, M L Littman - 2000
24 Better automated abstraction techniques for imperfect information games, with application to Texas Hold’em poker – Andrew Gilpin, Tuomas Sandholm - 2007
46 Efficient Computation of Behavior Strategies – Bernhard von Stengel - 1996
32 Gradient-based algorithms for finding nash equilibria in extensive form games – Andrew Gilpin, Javier Peña, Samid Hoda, Tuomas Sandholm - 2007
58 Regret minimization in games with incomplete information – Martin Zinkevich, Michael Bowling, Michael Johanson, Carmelo Piccione - 2007
10 Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker – Andrew Gilpin, Tuomas Sandholm - 2008
110 The Challenge of Poker – Darse Billings, Aaron Davidson, Jonathan Schaeffer, Duane Szafron - 2001
28 Abstraction Pathologies in Extensive Games – Kevin Waugh, David Schnizlein, Michael Bowling, Duane Szafron
25 SMOOTHING TECHNIQUES FOR COMPUTING NASH EQUILIBRIA OF SEQUENTIAL GAMES – Samid Hoda, Andrew Gilpin, Javier Peña
89 Fast Algorithms for Finding Randomized Strategies in Game Trees – Daphne Koller, Nimrod Megiddo, Bernhard von Stengel - 1994
223 The complexity of computing a Nash equilibrium – Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou - 2006
115 Representations and Solutions for Game-Theoretic Problems – Daphne Koller, Avi Pfeffer - 1997
20 A Practical Use of Imperfect Recall – Kevin Waugh, Martin Zinkevich, Michael Johanson, Morgan Kan, David Schnizlein, Michael Bowling
86 Simple Search Methods for Finding a Nash Equilibrium – Ryan Porter, Eugene Nudelman, Yoav Shoham - 2004
32 Reduction of a game with complete memory to a matrix game. Soviet Mathematics – I V Romanovskii - 1962