Lossless abstraction of imperfect information games (2007)

Cached

Download Links

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

Active Bibliography

2 Algorithms for abstracting and solving imperfect information games – Andrew Gilpin - 2007
29 Finding equilibria in large sequential games of imperfect information – Andrew Gilpin - 2006
55 Computing Equilibria for Two-Person Games – Bernhard von Stengel - 1999
A competitive Texas Hold'em . . . – Andrew Gilpin, Tuomas Sandholm - 2006
45 A competitive Texas Hold’em poker player via automated abstraction and realtime equilibrium computation – Andrew Gilpin, Tuomas Sandholm - 2006
22 Computing best-response strategies in infinite games of incomplete information – Daniel M. Reeves, Michael P. Wellman - 2004
Representing and Reasoning with Large Games by – Xin Jiang - 2011
9 Computing Normal Form Perfect Equilibria For Extensive Two-Person Games – Bernhard von Stengel, Antoon Van Den Elzen, Dolf Talman - 2001
14 Using Counterfactual Regret Minimization to Create Competitive Multiplayer Poker Agents – Nick Abou Risk, Duane Szafron - 2010
25 New Complexity Results about Nash Equilibria – Vincent Conitzer , Tuomas Sandholm - 2008
7 A Technique for Reducing Normal-Form Games to Compute a Nash Equilibrium – Vincent Conitzer, Tuomas Sandholm
8 The approximation complexity of win-lose games – Xi Chen, Shang-hua Teng - 2007
7 Computing equilibria: A computational complexity perspective – Tim Roughgarden - 2009
16 Algorithms and Assessment in Computer Poker – Darse Billings - 2006
68 Computing Nash equilibria: Approximation and smoothed complexity – Xi Chen, Xiaotie Deng, Shang-hua Teng - 2006
2 A principled methodology for the design of autonomous trading agents with combinatorial preferences in the presense of tradeoffs – Ioannis A. Vetsikas - 2005
10 The State of Solving Large Incomplete-Information Games, and Application to Poker – Tuomas Sandholm - 2010
24 Better automated abstraction techniques for imperfect information games, with application to Texas Hold’em poker – Andrew Gilpin, Tuomas Sandholm - 2007
32 Gradient-based algorithms for finding nash equilibria in extensive form games – Andrew Gilpin, Javier Peña, Samid Hoda, Tuomas Sandholm - 2007