Lossless abstraction of imperfect information games (2007)

Cached

Download Links

by Andrew Gilpin , Tuomas Sandholm
Venue:Journal of the ACM
Citations:14 - 7 self

Active Bibliography

1 Algorithms for abstracting and solving imperfect information games – Andrew Gilpin - 2007
24 Finding equilibria in large sequential games of imperfect information – Andrew Gilpin - 2006
A competitive Texas Hold'em . . . – Andrew Gilpin, Tuomas Sandholm - 2006
9 Algorithms and Assessment in Computer Poker – Darse Billings - 2006
47 Computing Equilibria for Two-Person Games – Bernhard von Stengel - 1998
6 Computing equilibria: A computational complexity perspective – Tim Roughgarden - 2009
19 Computing best-response strategies in infinite games of incomplete information – Daniel M. Reeves, Michael P. Wellman - 2004
27 Gradient-based algorithms for finding nash equilibria in extensive form games – Andrew Gilpin, Javier Peña, Samid Hoda, Tuomas Sandholm - 2007
35 A continuation method for Nash equilibria in structured games – Ben Blum, Christian R. Shelton, Daphne Koller - 2003
8 Computing Normal Form Perfect Equilibria For Extensive Two-Person Games – Bernhard Von Stengel, Antoon Van Den Elzen, Dolf Talman - 2001
10 Computing sequential equilibria for two-player games – Peter Bro Miltersen, Troels Bjerre Sørensen - 2006
6 Using Counterfactual Regret Minimization to Create Competitive Multiplayer Poker Agents – Nick Abou Risk, Duane Szafron - 2010
13 New Complexity Results about Nash Equilibria – Vincent Conitzer , Tuomas Sandholm - 2008
52 Computing Nash equilibria: approximation and smoothed complexity – Xi Chen - 2006
6 Monte Carlo Approximation in Incomplete-Information Sequential-Auction Games – Gangshu Cai, Peter R. Wurman - 2003
2 Monte Carlo approximation in incomplete information, sequential auction games – Gangshu Cai, Peter R. Wurman - 2005
8 Structural Leverage and Fictitious Play in Sequential Auctions – Weili Zhu, Peter R. Wurman - 2002
Chapter 3.1 The Role of Imperfect Information – unknown authors
2 Articles The State of Solving Large Incomplete-Information Games, and Application to Poker – Tuomas Sandholm