812 citations · 929 across the 10 of their papers we have counts for
5 papers · 1 filter
Learning not to Regret
David Sychrovský, Michal Šustr, Elnaz Davoodi +3
The literature on game-theoretic equilibrium finding predominantly focuses on single games or their repeated play. Nevertheless, numerous real-world scenarios feature playing a gam…
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…
Low-Variance and Zero-Variance Baselines for Extensive-Form Games
Trevor Davis, Martin Schmid, Michael Bowling
Extensive-form games (EFGs) are a common model of multi-agent interactions with imperfect information. State-of-the-art algorithms for solving these games typically perform full wa…
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…