1.1k citations · 1.6k across the 12 of their papers we have counts for
8 papers · 1 filter
Game Theoretic Rating in N-player general-sum games with Equilibria
Luke Marris, Marc Lanctot, Ian Gemp +5
Rating strategies in a game is an important area of research in game theory and artificial intelligence, and can be applied to any real-world competitive or cooperative setting. Tr…
Anytime PSRO for Two-Player Zero-Sum Games
Stephen McAleer, Kevin Wang, John Lanier +4
Policy space response oracles (PSRO) is a multi-agent reinforcement learning algorithm that has achieved state-of-the-art performance in very large two-player zero-sum games. PSRO…
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…
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…
A Generalised Method for Empirical Game Theoretic Analysis
Karl Tuyls, Julien Perolat, Marc Lanctot +2
This paper provides theoretical bounds for empirical game theoretical analysis of complex multi-agent interactions. We provide insights in the empirical meta game showing that a Na…