Reproduce “Polylogarithmic Collective Tree Exploration” 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
Romain Cosson, Laurent Massoulié
The authors present a deterministic algorithm for exploring unknown rooted trees with k agents, even when an adversary chooses which agent moves at each step. It minimizes a fractional load regularizer, then repairs the plan into whole-agent movements with bounded cost. The algorithm uses at most 2n+O(k log²(k)D) moves, matching the known Ω(log² k) lower-bound dependence in this model.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.