Lossless abstraction of imperfect information games (2007)


Download Links

by Andrew Gilpin , Tuomas Sandholm
Venue:Journal of the ACM
Citations:22 - 10 self

Documents Related by Co-Citation

11073 Computers and Intractability: A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
128 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
46 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