Fixed Sets and the Hardness of Computing Correlated Equilibria

The paper proves that computing an approximate correlated equilibrium for a polytope game is PPAD‑complete, showing it is polynomial‑time equivalent to finding a Nash equilibrium. It introduces the notion of a fixed set—a finite set contained in the convex hull of its image under a continuous function—and demonstrates that computing such a fixed set is PPAD‑hard even at inverse polynomial precision.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.