|
104
|
Approximating Game-Theoretic Optimal Strategies for Full-scale Poker
– D. Billings, N. Burch, A. Davidson, R. Holte, J. Schaeffer, T. Schauenberg, D. Szafron
- 2003
|
|
18
|
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
|
|
27
|
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
|
|
35
|
A competitive texas hold’em poker player via automated abstraction and realtime equilibrium computation
– A Gilpin, T Sandholm
- 2006
|
|
17
|
Better automated abstraction techniques for imperfect information games, with application to Texas Hold’em poker
– Andrew Gilpin, Tuomas Sandholm
- 2007
|
|
29
|
Abstraction methods for game theoretic poker
– J Shi, M Littman
|
|
27
|
Gradient-based algorithms for finding nash equilibria in extensive form games
– Andrew Gilpin, Javier Peña, Samid Hoda, Tuomas Sandholm
- 2007
|
|
37
|
Efficient Computation of Behavior Strategies
– Bernhard Von Stengel
- 1996
|
|
89
|
The Challenge of Poker
– Darse Billings, Aaron Davidson, Jonathan Schaeffer, Duane Szafron
- 2001
|
|
7
|
Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker
– Andrew Gilpin, Tuomas S
|
|
38
|
Regret minimization in games with incomplete information
– Martin Zinkevich, Michael Bowling, Michael Johanson, Carmelo Piccione
- 2007
|
|
12
|
SMOOTHING TECHNIQUES FOR COMPUTING NASH EQUILIBRIA OF SEQUENTIAL GAMES
– Samid Hoda, Andrew Gilpin, Javier, Pe Ña
|
|
105
|
Representations and Solutions for Game-Theoretic Problems
– Daphne Koller, Avi Pfeffer
- 1997
|
|
30
|
Reduction of a game with complete memory to a matrix game
– I V Romanovskii
- 1962
|
|
18
|
Abstraction Pathologies in Extensive Games
– Kevin Waugh, David Schnizlein, Michael Bowling, Duane Szafron
|
|
25
|
On the complexity of two-player win-lose games
– Tim Abbott, Daniel Kane, Paul Valiant
- 2005
|
|
72
|
Efficient Computation of Equilibria for Extensive Two-Person Games
– Daphne Koller, Nimrod Megiddo, Bernhard Von Stengel
- 1996
|
|
10
|
Computing an Approximate Jam/Fold Equilibrium for 3-player No-Limit Texas Hold’em Tournaments
– Sam Ganzfried, Tuomas Sandholm
- 2008
|
|
76
|
Fast Algorithms for Finding Randomized Strategies in Game Trees
– Daphne Koller, Nimrod Megiddo, Bernhard von Stengel
- 1994
|
