Reproduce “GDBA Revisited: Unleashing the Power of Guided Local Search for Distributed Constraint Optimization” 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
Yanchen Deng, Xinrun Wang, Bo An
DGLS improves distributed local search for agents minimizing a shared cost by selectively penalizing costly constraints, geometrically decaying penalties, and coordinating neighboring agents’ updates. The authors evaluate it with anytime cost, the best-so-far solution cost over search rounds. On weighted graph coloring and meeting scheduling, it improves on DMS by 61.24%–66.30% and 5.47%–9.45%, respectively; it is competitive, not uniformly superior, elsewhere.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.