← Authors

Marc Lanctot

30 papers · 2009–2025 · 5 conferences · across top CS/AI conferences

Achievements

🌍 Conference Polyglot (5) 🐣 Hot Topic Early Bird πŸ—ΊοΈ Taxonomy Completionist (28) πŸŒ‰ Interdisciplinary Bridge 🌈 Renaissance Researcher (5) 🐝 Cross-Pollinator (8) 🧭 Keyword Pioneer πŸƒ Academic Marathon (16) 🌟 Keyword Trendsetter Combo (4) πŸ‘‘ Triple Crown πŸ† Keyword Champion (2) πŸ”¬ Deep Specialist (14) πŸ† Grand Slam πŸ“ˆ Trend Setter ⚑ Prolific Year (6) πŸš€ Conference Pioneer πŸ’Ž Century Club (30) πŸ”₯ Unstoppable (11) πŸ—ƒοΈ Keyword Collector (96)

Conferences

NIPS (9) ICML (8) ICLR (5) AAAI (4) IJCAI (4)

Top co-authors

Michael Bowling (9) Karl Tuyls (8) Julien PΓ©rolat (7) RΓ©mi Munos (5) Neil Burch (5) Luke Marris (5) Edward Lockhart (4) Finbarr Timbers (4) Thore Graepel (4) Daniel Hennes (4)

Keywords

game theory (12) nash equilibrium (7) extensive-form game (6) zero-sum game (6) counterfactual regret minimization (4) deep reinforcement learning (3) imperfect information game (3) imperfect information (3) policy optimization (3) regret minimization (3) monte carlo sampling (3) multi-agent reinforcement learning (3) multi-agent learning (2) sequential game (2) monte carlo method (2) monte carlo tree search (2) policy gradient (2) variance reduction (2) correlated equilibrium (2) fictitious play (2)

Papers

Combining Deep Reinforcement Learning and Search with Generative Models for Game-Theoretic Opponent Modeling IJCAI 2025
Mastering Board Games by External and Internal Planning with Language Models ICML 2025
Re-evaluating Open-ended Evaluation of Large Language Models ICLR 2025
Learning Not to Regret AAAI 2024
ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret ICLR 2023
A Unified Approach to Reinforcement Learning, Quantal Response Equilibria, and Two-Player Zero-Sum Games ICLR 2023
Simplex Neural Population Learning: Any-Mixture Bayes-Optimality in Symmetric Zero-sum Games ICML 2022
Approximate Exploitability: Learning a Best Response IJCAI 2022
Hindsight and Sequential Rationality of Correlated Play AAAI 2021
Solving Common-Payoff Games with Approximate Policy Iteration AAAI 2021
Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games ICML 2021
Dynamic population-based meta-learning for multi-agent communication with natural language NIPS 2021
From PoincarΓ© Recurrence to Convergence in Imperfect Information Games: Finding Equilibrium via Regularization ICML 2021
Multi-Agent Training beyond Zero-Sum with Correlated Equilibrium Meta-Solvers ICML 2021
Fast computation of Nash Equilibria in Imperfect Information Games ICML 2020
Learning to Play No-Press Diplomacy with Best Response Policy Iteration NIPS 2020
A Generalized Training Approach for Multiagent Learning ICLR 2020
Computing Approximate Equilibria in Sequential Adversarial Games by Exploitability Descent IJCAI 2019
Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games Using Baselines AAAI 2019
Emergent Communication through Negotiation ICLR 2018
Actor-Critic Policy Optimization in Partially Observable Multiagent Environments NIPS 2018
A Unified Game-Theoretic Approach to Multiagent Reinforcement Learning NIPS 2017
Dueling Network Architectures for Deep Reinforcement Learning ICML 2016
Memory-Efficient Backpropagation Through Time NIPS 2016
Fictitious Self-Play in Extensive-Form Games ICML 2015
Convergence of Monte Carlo Tree Search in Simultaneous Move Games NIPS 2013
Monte Carlo *-Minimax Search IJCAI 2013
Efficient Monte Carlo Counterfactual Regret Minimization in Games with Many Player Actions NIPS 2012
Variance Reduction in Monte-Carlo Tree Search NIPS 2011
Monte Carlo Sampling for Regret Minimization in Extensive Games NIPS 2009