Research map / Learning theory and algorithms / Submodular and game algorithms
Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions
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 the tree-decomposition LP instead of FCGS-21 | Team correlated equilibrium solving · 21L133 (Leduc poker) | runtime: 2m23s -> 0.49s | Helped |
| Use the tree-decomposition LP instead of FCGS-21 | Team correlated equilibrium solving · 21L223 (Leduc poker) | runtime: 3m29s -> 0.23s | Helped |
| Use the tree-decomposition LP instead of FCGS-21 | Team correlated equilibrium solving · 21D3 (Liar's Dice) | runtime: 1m12s -> 2.03s | Helped |
| Use the tree-decomposition LP instead of FCGS-21 | Team correlated equilibrium solving · 21G (Goofspiel) | runtime: 1.18s -> 0.08s | Helped |
| Use the tree-decomposition LP instead of FCGS-21 | Team correlated equilibrium solving · 21GL (limited-information Goofspiel) | runtime: 0.33s -> 0.06s | Helped |
| Apply the tree-decomposition LP to Kuhn poker with many types | Team correlated equilibrium solving · 21K8 (Kuhn poker) | runtime: 4s -> 2m24s | Hurt |
| Apply the tree-decomposition LP to a larger Kuhn poker instance | Team correlated equilibrium solving · 21K12 (Kuhn poker) | runtime | Hurt |
Closest papers by meaning
- Computing Team-Maxmin Equilibria in Zero-Sum Multiplayer Extensive-Form Games (AAAI 2020 · similarity 0.91)
- Team-Maxmin Equilibrium: Efficiency Bounds and Algorithms (AAAI 2017 · similarity 0.90)
- Team Belief DAG: Generalizing the Sequence Form to Team Games for Fast Computation of Correlated Team Max-Min Equilibria via Regret Minimization (ICML 2023 · similarity 0.90)
- Connecting Optimal Ex-Ante Collusion in Teams to Extensive-Form Correlation: Faster Algorithms and Positive Complexity Results (ICML 2021 · similarity 0.90)
- Team-Fictitious Play for Reaching Team-Nash Equilibrium in Multi-team Games (NeurIPS 2024 · similarity 0.89)
- The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games (NeurIPS 2025 · similarity 0.88)
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.