812 citations · 980 across the 6 of their papers we have counts for
5 papers · 1 filter
Sound Algorithms in Imperfect Information Games
Michal Šustr, Martin Schmid, Matej Moravčík +3
Search has played a fundamental role in computer game research since the very beginning. And while online search has been commonly used in perfect information games such as Chess a…
From Poincaré Recurrence to Convergence in Imperfect Information Games: Finding Equilibrium via Regularization
Julien Perolat, Remi Munos, Jean-Baptiste Lespiau +10
In this paper we investigate the Follow the Regularized Leader dynamics in sequential imperfect information games (IIG). We generalize existing results of Poincaré recurrence from…
Revisiting CFR+ and Alternating Updates
Neil Burch, Matej Moravcik, Martin Schmid
The CFR+ algorithm for solving imperfect information games is a variant of the popular CFR algorithm, with faster empirical performance on a range of problems. It was introduced wi…
Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games using Baselines
Martin Schmid, Neil Burch, Marc Lanctot +3
Learning strategies for imperfect information games from samples of interaction is a challenging problem. A common method for this setting, Monte Carlo Counterfactual Regret Minimi…
Bayes' Bluff: Opponent Modelling in Poker
Finnegan Southey, Michael P. Bowling, Bryce Larson +4
Poker is a challenging problem for artificial intelligence, with non-deterministic dynamics, partial observability, and the added difficulty of unknown adversaries. Modelling all o…