The paper establishes Contr-hardness for correlated equilibria in concave quadratic games, an exponential lower bound on swap regret minimization, and FPTAS algorithms for poly-dimensional Φ-equilibria in concave games.
On the complexity of the optimal correlated equilibria in extensive-form games
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2roles
background 1polarities
background 1representative citing papers
AutoResearchBench is a new benchmark showing top AI agents achieve under 10% success on complex scientific literature discovery tasks that demand deep comprehension and open-ended search.
citing papers explorer
-
On the Complexity of Correlated Equilibria Beyond Normal-Form Games
The paper establishes Contr-hardness for correlated equilibria in concave quadratic games, an exponential lower bound on swap regret minimization, and FPTAS algorithms for poly-dimensional Φ-equilibria in concave games.
-
AutoResearchBench: Benchmarking AI Agents on Complex Scientific Literature Discovery
AutoResearchBench is a new benchmark showing top AI agents achieve under 10% success on complex scientific literature discovery tasks that demand deep comprehension and open-ended search.