Reduced Space and Faster Convergence in Imperfect-Information Games via Regret-Based Pruning

A simple adaptive procedure leading to correlated equilibrium

Sergiu Hart and Andreu Mas-Colell · 2000

Earlier work this paper cites.

Excessive gap technique in nonsmooth convex minimization

Yurii Nesterov · 2005

Earlier work this paper cites.

Bayes’ bluff: Opponent modelling in poker

Finnegan Southey, Michael Bowling, Bryce Larson, Carmelo Piccione, Neil Burch, Darse Billings, and Chris Rayner · 2005

Earlier work this paper cites.

Lossless abstraction of imperfect information games

Andrew Gilpin and Tuomas Sandholm · 2006

Earlier work this paper cites.

Regret minimization in games with incomplete information

Original

Martin Zinkevich, Michael Bowling, Michael Johanson, and Carmelo Piccione · 2007

Earlier work this paper cites.

Monte Carlo sampling for regret minimization in extensive games

Marc Lanctot, Kevin Waugh, Martin Zinkevich, and Michael Bowling · 2009

Earlier work this paper cites.

Abstraction pathologies in extensive games

Kevin Waugh, David Schnizlein, Michael Bowling, and Duane Szafron · 2009

Cited alongside, same era.

Smoothing techniques for computing Nash equilibria of sequential games

Samid Hoda, Andrew Gilpin, Javier Peña, and Tuomas Sandholm · 2010

Cited alongside, same era.

An interior point approach to large games of incomplete information

François Pays · 2014

Cited alongside, same era.

Heads-up limit hold’em poker is solved

Michael Bowling, Neil Burch, Michael Johanson, and Oskari Tammelin · 2015

Cited alongside, same era.

Regret-based pruning in extensive-form games

Noam Brown and Tuomas Sandholm · 2015

Cited alongside, same era.

Simultaneous abstraction and equilibrium finding in games

Noam Brown and Tuomas Sandholm · 2015

Later among the works it cites.

Faster first-order methods for extensive-form game solving

Christian Kroer, Kevin Waugh, Fatma Kılınç-Karzan, and Tuomas Sandholm · 2015

Later among the works it cites.

Solving heads-up limit texas hold’em

Oskari Tammelin, Neil Burch, Michael Johanson, and Michael Bowling · 2015

Later among the works it cites.

Strategy-based warm starting for regret minimization in games

Noam Brown and Tuomas Sandholm · 2016

Closest in time.

Refining subgames in large imperfect information games

Matej Moravcik, Martin Schmid, Karel Ha, Milan Hladik, and Stephen J Gaukrodger · 2016

Closest in time.