Reproduce “Fixed Sets and the Hardness of Computing Correlated Equilibria” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Noah Golowich, Tuomas Sandholm, Brian Hu Zhang
Authors connect correlated-equilibrium computation to fixed-set search, where a finite group of points supports each point through convex averages of map outputs. This connection transfers fixed-point hardness to a two-player concave game on continuous strategy spaces, with utilities quadratic in each player’s own strategy. Finding a correlated equilibrium with inverse-polynomial accuracy and polynomial support is PPAD-hard in this setting.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.