Reproduce “Competitive Equilibrium for Linear Chores is CLS-complete” 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
Qian Liu, Shinuo Ma, Yixin Tao, Minji Yang, Weiqiang Zheng
The authors prove that computing exact competitive equilibria in Fisher markets with divisible chores and linear disutilities is CLS-complete. They construct a market whose prices encode a quadratic program over the unit box: any exact rational equilibrium yields an ε-KKT point in polynomial time. The result makes efficient algorithms unlikely unless CLS=P; it does not rule them out unconditionally.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.