Fetching the paper…

Reading the bibliography…

2013

Measuring the Size of Large No-Limit Poker Games

Johanson, Michael

Original
PDF
Post on X

Understand

In the field of computational game theory, games are often compared in terms of their size.

This can be measured in several ways, including the number of unique game states, the number of decision points, and the total number of legal actions over all decision points.
These numbers are either known or estimated for a wide range of classic games such as chess and checkers.
In the stochastic and imperfect information game of poker, these sizes are easily computed in "limit" games which restrict the players' available actions, but until now had only been estimated for the more complicated "no-limit" variants.

Measuring the Size of Large No-Limit Poker Games · Around

Built on

Approximating game-theoretic optimal strategies for full-scale poker
D. Billings, N. Burch, A. Davidson, R. Holte, J. Schaeffer, T. Schauenberg, and D. Szafron · 2003
Earlier work this paper cites.
The AAAI computer poker competition
Original
M. Zinkevich and M. Littman · 2006
Earlier work this paper cites.
Gradient-based algorithms for finding nash equilibria in extensive form games
A. Gilpin, S. Hoda, J. Peña, and T. Sandholm · 2007
Earlier work this paper cites.
A near-optimal strategy for a heads-up no-limit texas hold’em poker tournament
P. B. Miltersen and T. B. Sørensen · 2007
Earlier work this paper cites.

Similar

A heads-up no-limit texas hold’em poker player: Discretized betting models and automatically generated equilibrium-finding programs
A. Gilpin, T. Sandholm, and T. B. Sørensen · 2008
Cited alongside, same era.
Regret minimization in games with incomplete information
M. Zinkevich, M. Johanson, M. Bowling, and C. Piccione · 2008
Cited alongside, same era.
The Annual Computer Poker Competition webpage
N. Bard · 2010
Cited alongside, same era.
Accelerating best response calculation in large extensive games
M. Johanson, K. Waugh, M. Bowling, and M. Zinkevich · 2011
Cited alongside, same era.
http://gmplib.org/
The GNU Multiple Precision Arithmetic Library
Cited in the paper.

Then

Finding optimal abstract strategies in extensive-form games
M. Johanson, N. Bard, N. Burch, and M. Bowling · 2012
Later among the works it cites.
Efficient nash equilibrium approximation through monte carlo counterfactual regret minimization
M. Johanson, N. Bard, M. Lanctot, R. Gibson, and M. Bowling · 2012
Later among the works it cites.
Game complexity — Wikipedia, the free encyclopedia, 2013
Wikipedia · 2013
Closest in time.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…