mlsanityData to 7 Oct 2026

Solving Large Imperfect Information Games Using CFR+

arXiv 1407.5042 ↗First posted 18 Jul 2014cs.GTcited by 78

Not on the map. Why?

Abstract (arXiv)

Counterfactual Regret Minimization and variants (e.g. Public Chance Sampling CFR and Pure CFR) have been known as the best approaches for creating approximate Nash equilibrium solutions for imperfect information games such as poker. This paper introduces CFR^+, a new algorithm that typically outperforms the previously known algorithms by an order of magnitude or more in terms of computation time while also potentially requiring less memory.

Key facts. Cited by 78 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Jul 2014.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 9; 2022: 10; 2023: 14; 2024: 10; 2025: 15; 2026: 20.

78 papers.

Sort:

By area:

  1. 2023Language Agents with Reinforcement Learning for Strategic Play in the Werewolf Gamecited by 148
  2. 2023Suspicion-Agent: Playing Imperfect Information Games with Theory of Mind Aware GPT-4cited by 67
  3. 2022A Unified Approach to Reinforcement Learning, Quantal Response Equilibria, and Two-Player Zero-Sum Gamescited by 64
  4. 2021XDO: A Double Oracle Algorithm for Extensive-Form Gamescited by 34
  5. 2023Multi-agent Reinforcement Learning: A Comprehensive Surveycited by 30
  6. 2021Last-iterate Convergence in Extensive-Form Gamescited by 27
  7. 2022Near-Optimal Learning of Extensive-Form Games with Imperfect Informationcited by 26
  8. 2024A Survey on Self-play Methods in Reinforcement Learningcited by 26
  9. 2021Simple Uncoupled No-Regret Learning Dynamics for Extensive-Form Correlated Equilibriumcited by 22
  10. 2021Model-Free Learning for Two-Player Zero-Sum Partially Observable Markov Games with Perfect Recallcited by 21
  11. 2021Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Gamescited by 14
  12. 2023Regret Matching+: (In)Stability and Fast Convergence in Gamescited by 13
38 more
  1. 2025Learning Strategic Language Agents in the Werewolf Game with Iterative Latent Space Policy Optimizationcited by 13
  2. 2025Reevaluating Policy Gradient Methods for Imperfect-Information Gamescited by 13
  3. 2021Model-Free Online Learning in Unknown Sequential Decision Making Problems and Gamescited by 12
  4. 2022Adapting to game trees in zero-sum imperfect information gamescited by 11
  5. 2024RL-CFR: Improving Action Abstraction for Imperfect Information Extensive-Form Games with Reinforcement Learningcited by 10
  6. 2023Adaptively Perturbed Mirror Descent for Learning in Gamescited by 9
  7. 2021Search in Imperfect Information Gamescited by 8
  8. 2022Mutation-Driven Follow the Regularized Leader for Last-Iterate Convergence in Zero-Sum Gamescited by 8
  9. 2022HSVI can solve zero-sum Partially Observable Stochastic Gamescited by 8
  10. 2024Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descentcited by 7
  11. 2026How Far Are LLMs from Professional Poker Players? Revisiting Game-Theoretic Reasoning with Agentic Tool Usecited by 7
  12. 2022A Marriage between Adversarial Team Games and 2-player Games: Enabling Abstractions, No-regret Learning, and Subgame Solvingcited by 6
  13. 2025From Average-Iterate to Last-Iterate Convergence in Games: A Reduction and Its Applicationscited by 6
  14. 2026Real-Time Parallel Counterfactual Regret Minimizationcited by 6
  15. 2023Last-Iterate Convergence Properties of Regret-Matching Algorithms in Gamescited by 5
  16. 2022Public Information Representation for Adversarial Team Gamescited by 4
  17. 2022Learning Correlated Equilibria in Mean-Field Gamescited by 4
  18. 2026Agents That Certify Their Own Exploits: Confidence-Scheduled Restricted Responses for Safe Opponent Exploitationcited by 4
  19. 2021Optimistic and Adaptive Lagrangian Hedgingcited by 3
  20. 2022A Survey of Decision Making in Adversarial Gamescited by 3
  21. 2023Guarantees for Self-Play in Multiplayer Games via Polymatrix Decomposabilitycited by 3
  22. 2025Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Gamescited by 3
  23. 2026Discovering Multiagent Learning Algorithms with Large Language Modelscited by 3
  24. 2026When a Verified World Model Still Loses: Play-Adequacy vs Prediction-Accuracy in LLM-Synthesized Code World Modelscited by 3
  25. 2023Learning not to Regretcited by 2
  26. 2023Local and adaptive mirror descents in extensive-form gamescited by 2
  27. 2024Understanding Iterative Combinatorial Auction Designs via Multi-Agent Reinforcement Learningcited by 2
  28. 2025Convergence of Regret Matching in Potential Games and Constrained Optimizationcited by 2
  29. 2026Code-Space Response Oracles: Generating Interpretable Multi-Agent Policies with Large Language Modelscited by 2
  30. 2026Parallelizing Counterfactual Regret Minimizationcited by 2
  31. 2026Which Nash Equilibrium? Solver-Dependent Selection on Zero-Sum Nash Polytopescited by 2
  32. 2026Optimal Alternating Regret for Online Learning and Gamescited by 2
  33. 2023Composing Efficient, Robust Tests for Policy Selectioncited by 1
  34. 2024Balancing the AI Strength of Roles in Self-Play Training with Regret Matching+cited by 1
  35. 2024Optimistic Thompson Sampling for No-Regret Learning in Unknown Gamescited by 1
  36. 2024Configurable Mirror Descent: Towards a Unification of Decision Makingcited by 1
  37. 2025On the Power of Perturbation under Sampling in Solving Extensive-Form Gamescited by 1
  38. 2025Faster Game Solving via Asymmetry of Step Sizescited by 1

50 most cited of 78 All 78 (JSON)