Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games
Not on the map. Why?
Abstract (arXiv)
Hindsight rationality is an approach to playing general-sum games that prescribes no-regret learning dynamics for individual agents with respect to a set of deviations, and further describes jointly rational behavior among multiple agents with mediated equilibria. To develop hindsight rational learning in sequential decision-making settings, we formalize behavioral deviations as a general class of deviations that respect the structure of extensive-form games. Integrating the idea of time selection into counterfactual regret minimization (CFR), we introduce the extensive-form regret minimization (EFR) algorithm that achieves hindsight rationality for any given set of behavioral deviations with computation that scales closely with the complexity of the set. We identify behavioral deviation subsets, the partial sequence deviation types, that subsume previously studied types and lead to efficient EFR instances in games with moderate lengths. In addition, we present a thorough empirical analysis of EFR instantiated with different deviation types in benchmark games, where we find that stronger types typically induce better performance.
Key facts. Cited by 15 papers in the map (data through 13 Oct 2026). Builds on 19 of its 58 references that are in the map. First posted on arXiv 13 Feb 2021.
Builds on
19 of 58 references.
References · 19
- 2013Optimization, Learning, and Games with Predictable Sequencescited by 187
- 2019OpenSpiel: A Framework for Reinforcement Learning in Gamescited by 183
- 2015Fast Convergence of Regularized Learning in Gamescited by 149
- 2018Deep Counterfactual Regret Minimizationcited by 102
- 2014Solving Large Imperfect Information Games Using CFR+cited by 78
- 2018Bayesian Action Decoder for Deep Multi-Agent Reinforcement Learningcited by 68
- 2020Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descentcited by 56
- 2020DREAM: Deep Regret minimization with Advantage baselines and Model-free learningcited by 36
- 2018Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games using Baselinescited by 24
- 2019Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarkscited by 23
- 2020Hindsight and Sequential Rationality of Correlated Playcited by 22
- 2019Stable-Predictive Optimistic Counterfactual Regret Minimizationcited by 21
7 more
- 2019Coarse Correlation in Extensive-Form Gamescited by 17
- 2014Solving Games with Functional Regret Estimationcited by 12
- 2019Low-Variance and Zero-Variance Baselines for Extensive-Form Gamescited by 9
- 2014A Unified View of Large-scale Zero-sum Equilibrium Computationcited by 7
- 2019Alternative Function Approximation Parameterizations for Solving Games: An Analysis of f-Regression Counterfactual Regret Minimizationcited by 5
- 2019Combining No-regret and Q-learningcited by 4
- 2021Optimistic and Adaptive Lagrangian Hedgingcited by 3
Built on by
Citing papers per year: 2021: 4; 2022: 5; 2023: 1; 2024: 0; 2025: 3; 2026: 2.
15 papers.
Sort:
By area:
- 2021When Can We Learn General-Sum Markov Games with a Large Number of Players Sample-Efficiently?cited by 66
- 2022Near-Optimal Learning of Extensive-Form Games with Imperfect Informationcited by 26
- 2021Simple Uncoupled No-Regret Learning Dynamics for Extensive-Form Correlated Equilibriumcited by 22
- 2022Efficient Phi-Regret Minimization in Extensive-Form Games via Online Mirror Descentcited by 15
- 2025Rethinking the Foundations for Continual Reinforcement Learningcited by 15
- 2022Learning Correlated Equilibria in Mean-Field Gamescited by 5
- 2025Expected Variational Inequalitiescited by 5
- 2025Learning and Computation of Phi-Equilibria at the Frontier of Tractabilitycited by 4
- 2022Near-Optimal Phi-Regret Learning in Extensive-Form Gamescited by 3
- 2023Guarantees for Self-Play in Multiplayer Games via Polymatrix Decomposabilitycited by 3
- 2026An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to Phi-Regret Minimizationcited by 3
- 2021Evolutionary Dynamics and Phi-Regret Minimization in Gamescited by 2
3 more
- 2021The Partially Observable History Processcited by 2
- 2022Safe Subgame Resolving for Extensive Form Correlated Equilibriumcited by 0
- 2026Normal-Form Correlation in Markov Gamescited by 0
- 2026Normal-Form Correlation in Markov Games2 Oct 2026
- 2026An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to Phi-Regret Minimization21 Apr 2026
- 2025Rethinking the Foundations for Continual Reinforcement Learning10 Apr 2025
- 2025Expected Variational Inequalities25 Feb 2025
- 2025Learning and Computation of Phi-Equilibria at the Frontier of Tractability25 Feb 2025
- 2023Guarantees for Self-Play in Multiplayer Games via Polymatrix Decomposability17 Oct 2023
- 2022Safe Subgame Resolving for Extensive Form Correlated Equilibrium29 Dec 2022
- 2022Learning Correlated Equilibria in Mean-Field Games22 Aug 2022
- 2022Near-Optimal Phi-Regret Learning in Extensive-Form Games20 Aug 2022
- 2022Efficient Phi-Regret Minimization in Extensive-Form Games via Online Mirror Descent30 May 2022
- 2022Near-Optimal Learning of Extensive-Form Games with Imperfect Information3 Feb 2022
- 2021The Partially Observable History Process15 Nov 2021
- 2021When Can We Learn General-Sum Markov Games with a Large Number of Players Sample-Efficiently?cited by 66
- 2022Near-Optimal Learning of Extensive-Form Games with Imperfect Informationcited by 26
- 2021Simple Uncoupled No-Regret Learning Dynamics for Extensive-Form Correlated Equilibriumcited by 22
- 2022Efficient Phi-Regret Minimization in Extensive-Form Games via Online Mirror Descentcited by 15
- 2022Learning Correlated Equilibria in Mean-Field Gamescited by 5
- 2025Expected Variational Inequalitiescited by 5
- 2025Learning and Computation of Phi-Equilibria at the Frontier of Tractabilitycited by 4
- 2022Near-Optimal Phi-Regret Learning in Extensive-Form Gamescited by 3
- 2023Guarantees for Self-Play in Multiplayer Games via Polymatrix Decomposabilitycited by 3
- 2026An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to Phi-Regret Minimizationcited by 3
- 2021Evolutionary Dynamics and Phi-Regret Minimization in Gamescited by 2
- 2021The Partially Observable History Processcited by 2
12 most cited of 14 All 14 (JSON)
- 2026Normal-Form Correlation in Markov Games2 Oct 2026
- 2026An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to Phi-Regret Minimization21 Apr 2026
- 2025Expected Variational Inequalities25 Feb 2025
- 2025Learning and Computation of Phi-Equilibria at the Frontier of Tractability25 Feb 2025
- 2023Guarantees for Self-Play in Multiplayer Games via Polymatrix Decomposability17 Oct 2023
- 2022Safe Subgame Resolving for Extensive Form Correlated Equilibrium29 Dec 2022
- 2022Learning Correlated Equilibria in Mean-Field Games22 Aug 2022
- 2022Near-Optimal Phi-Regret Learning in Extensive-Form Games20 Aug 2022
- 2022Efficient Phi-Regret Minimization in Extensive-Form Games via Online Mirror Descent30 May 2022
- 2022Near-Optimal Learning of Extensive-Form Games with Imperfect Information3 Feb 2022
- 2021The Partially Observable History Process15 Nov 2021
- 2021When Can We Learn General-Sum Markov Games with a Large Number of Players Sample-Efficiently?8 Oct 2021
12 newest of 14 All 14 (JSON)