Reproduce “The Online $k$-Taxi Problem Is Competitive on All Metrics” 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
Christian Coester, Yichen Huang, Tze-Yang Poon
The authors present a randomized policy for the hard k-taxi problem that ranks taxis and uses a distance-sensitive random choice to reach each pickup. It charges only unpaid travel to pickups. The policy is 9^(k-1)-competitive against adaptive online adversaries on every metric space, with an additive constant independent of the request sequence; this is a mathematical guarantee, not a measured operational result.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.