mlsanityData to 13 Oct 2026

Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games

arXiv 2102.06973 ↗First posted 13 Feb 2021cs.GT cs.AIcited by 15

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

  1. 2013Optimization, Learning, and Games with Predictable Sequencescited by 187
  2. 2019OpenSpiel: A Framework for Reinforcement Learning in Gamescited by 183
  3. 2015Fast Convergence of Regularized Learning in Gamescited by 149
  4. 2018Deep Counterfactual Regret Minimizationcited by 102
  5. 2014Solving Large Imperfect Information Games Using CFR+cited by 78
  6. 2018Bayesian Action Decoder for Deep Multi-Agent Reinforcement Learningcited by 68
  7. 2020Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descentcited by 56
  8. 2020DREAM: Deep Regret minimization with Advantage baselines and Model-free learningcited by 36
  9. 2018Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games using Baselinescited by 24
  10. 2019Correlation in Extensive-Form Games: Saddle-Point Formulation and Benchmarkscited by 23
  11. 2020Hindsight and Sequential Rationality of Correlated Playcited by 22
  12. 2019Stable-Predictive Optimistic Counterfactual Regret Minimizationcited by 21
7 more
  1. 2019Coarse Correlation in Extensive-Form Gamescited by 17
  2. 2014Solving Games with Functional Regret Estimationcited by 12
  3. 2019Low-Variance and Zero-Variance Baselines for Extensive-Form Gamescited by 9
  4. 2014A Unified View of Large-scale Zero-sum Equilibrium Computationcited by 7
  5. 2019Alternative Function Approximation Parameterizations for Solving Games: An Analysis of f-Regression Counterfactual Regret Minimizationcited by 5
  6. 2019Combining No-regret and Q-learningcited by 4
  7. 2021Optimistic and Adaptive Lagrangian Hedgingcited by 3

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2021: 4; 2022: 5; 2023: 1; 2024: 0; 2025: 3; 2026: 2.

15 papers.

Sort:

By area: