Reproduce “Online Metric Matching with Unknown i.i.d. Arrivals” 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
Tsubasa Harada
The authors present an online matching algorithm for requests drawn independently from an unknown distribution. At each arrival, it uses the observed prefix to generate a proxy request, then applies Fair-Bias; the proxies are independent uniform server-label draws. On arbitrary metrics, its competitive ratio—expected cost versus expected offline perfect-matching cost—is O((log log log n)^2), an upper bound, not an optimality claim.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.