Reproduce “A Deterministic O(log m)-Competitive Algorithm for Online Minimum Cost Bipartite Matching with Delays” 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
Tung-Wei Kuo
The authors analyze VRM, an online matcher that maintains a revisable shadow matching while actual matches remain irrevocable. It waits until a request’s waiting time reaches a threshold set by the best reassignment chain. For bipartite matching with m requests and m servers, VRM’s ratio to the best offline matcher is 24+18 ln m at γ=2, bounding worst-case distance plus both sides’ waiting, not runtime.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.