Research map / Learning theory and algorithms / Submodular and game algorithms
Correlated equilibria in sequential games
Compute correlated and Nash equilibria in extensive-form, potential and Markov games.
86 accepted papers at ICML, NeurIPS, ICLR, CVPR and AAAI (2016–2026) · an approach in Submodular and game algorithms, keyword cluster “game · equilibrium · equilibria”
State History Tried Preprints Who Export
Where it stands
Not enough benchmark data Fewer than four papers report the same benchmark, so there is no record to follow.
20 papers in 2023–24 and 15 in 2025–26 (at ICML, NeurIPS, ICLR, CVPR and AAAI); its share of the topic shrank, from 9.9% to 6.2%.
How this is decided
A benchmark is tracked when at least four papers of this approach report their own method on the same dataset and metric in at least two different years. Its record is the best number reported up to 2024 compared with the best reported in 2025–26: still improving means at least 1% better, flat means at most 0.2% better with at least two papers from 2025–26 trying. Numbers on a different scale from the rest (a fraction among percentages) and far outliers are left out. Results come from different papers with different setups, so they are signals, not head-to-head comparisons. The share of papers is counted at ICML, NeurIPS, ICLR, CVPR and AAAI.
How it got here
Most cited paper of each year
- 2016 · Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games (AAAI 2016 · 40 citations)
- 2017 · Multiplicative Weights Update with Constant Step-Size in Congestion Games: Convergence, Limit Cycles and Chaos (NeurIPS 2017 · 56 citations)
- 2018 · Ex ante coordination and collusion in zero-sum multi-player extensive-form games (NeurIPS 2018 · 23 citations)
- 2019 · Learning to Correlate in Multi-Player General-Sum Sequential Games (NeurIPS 2019 · 19 citations)
- 2020 · Computing Equilibria in Binary Networked Public Goods Games (AAAI 2020 · 24 citations)
- 2021 · Follow-the-Regularized-Leader Routes to Chaos in Routing Games (ICML 2021 · 6 citations)
- 2022 · Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions (AAAI 2022 · 7 citations)
- 2023 · Reachability Games Modulo Theories with a Bounded Safety Player (AAAI 2023 · 12 citations)
- 2024 · Competition among Pairwise Lottery Contests (AAAI 2024 · 6 citations)
- 2025 · Computing Game Symmetries and Equilibria That Respect Them (AAAI 2025 · 3 citations)
- 2026 · Pacing Equilibria in Second-Price Auctions with Few Buyers (AAAI 2026 · 1 citation)
Earliest papers here
- Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games (AAAI 2016 · 40 citations)
- Price of Pareto Optimality in Hedonic Games (AAAI 2016 · 27 citations)
- From Duels to Battlefields: Computing Equilibria of Blotto and Other Games (AAAI 2016 · 22 citations)
What has been tried
57 papers here report 372 measured changes (a component added, removed or swapped, compared with a baseline): helped 67%, no clear effect 7%, hurt 21%, mixed 6%. Papers mostly publish changes that helped, so "helped" is over-represented.
Recent preprints
Loading recent arXiv preprints…
Who publishes on it
Institutions on the most papers of this approach since 2023 (of 35 papers; from OpenAlex and the papers' affiliations).
- Carnegie Mellon University · 5 papers
- Peking University · 3 papers
- Massachusetts Institute of Technology · 3 papers
- Renmin University of China · 2 papers
- University of California, Irvine · 2 papers
- Strategy Robot · 2 papers
- Optimized Markets · 2 papers
- Strategic Machine · 2 papers
- Google DeepMind · 2 papers
- Northwestern University · 2 papers
Use it
Download BibTeX of 40 key papersOpen the topic in the interactive map
Get alerts. Describe your idea in scime atlas and save it (free scime account): you get a weekly email when new preprints land close to it.
Related approaches
Same keyword cluster
- Zero-sum game learning dynamics (107 papers)
- Opponent modeling and subgame solving (116 papers)
- Equilibrium solvers for adversarial games (25 papers)
Elsewhere in the topic
- Fair division of indivisible goods (130 papers)
- Committee voting rules (120 papers)
- Matching markets and welfare (119 papers)
- Monotone submodular maximization (116 papers)
- Learned auction design (105 papers)
- Streaming submodular algorithms (73 papers)
- Submodular influence maximization (33 papers)
Benchmark numbers, ablations and baseline numbers are extracted by AI from each paper's full text and can be wrong; the paper is the authority. Data: results index of 2026-11-02, citation counts from OpenAlex (2026-10-09).