Reproduce “Online Matching with Arbitrary Stochastic Rewards” 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
Rajan Udwani
The authors analyze online matching with stochastic rewards, where failed probes release resources for later arrivals. They introduce randomized Perturbed Greedy, combining a greedy price floor with randomized priorities, and use shared arrival thresholds to analyze failures and changing choices. Against an adaptive offline benchmark, it guarantees ratios of at least 0.5915 unweighted and 0.5314 vertex-weighted, for arbitrary edge probabilities.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.