Research map / Learning theory and algorithms / Submodular and game algorithms
Polynomial-Time Computation of Optimal Correlated Equilibria in Two-Player Extensive-Form Games with Public Chance Moves and Beyond
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use scaled-extension regret minimization instead of the EFCE linear program | Computing EFCE in the largest game · Largest game | time per iteration: slightly more than 20 minutes -> roughly 6 seconds | Helped |
| Use scaled-extension regret minimization instead of the EFCE linear program | Computing EFCE in the largest game · Largest game | memory: roughly 200GB | Helped |
| Apply scaled-extension decomposition to triangle-free games | Goofspiel · Goofspiel k=5 | relevant sequence pairs handled: 3.6×10^7 | Helped |
Closest papers by meaning
- Coarse Correlation in Extensive-Form Games (AAAI 2020 · similarity 0.95)
- On the Outcome Equivalence of Extensive-Form and Behavioral Correlated Equilibria (AAAI 2024 · similarity 0.93)
- Polynomial-Time Computation of Exact $\Phi$-Equilibria in Polyhedral Games (NeurIPS 2024 · similarity 0.92)
- The Complexity of Correlated Equilibria in Generalized Games (NeurIPS 2025 · similarity 0.89)
- Near-Optimal Quantum Algorithms for Computing (Coarse) Correlated Equilibria of General-Sum Games (NeurIPS 2025 · similarity 0.88)
- Mediator Interpretation and Faster Learning Algorithms for Linear Correlated Equilibria in General Sequential Games (ICLR 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.