Reproduce “Computing Envy-Free up to Any Good (EFX) Allocations via Local Search” 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
Simina Brânzei
The authors develop a simulated-annealing search for exact EFX allocations of indivisible goods under additive valuations. It starts from a random allocation and transfers one good at a time, reducing fairness violations but sometimes accepting increases. In tested instances, it found EFX in every case; runtimes varied with item supply and correlation, with no termination guarantee for distinct valuations.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.