Reproduce “Order-selection Prophet Inequality (Almost) Goes I.I.D” 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
Bo Peng, Zhihao Gavin Tang
The authors present a selection algorithm for independent nonnegative values. It assigns each item an independent arrival time and an arrival-dependent threshold, using a local rule to preserve a fixed fraction of its chance of being the maximum. The algorithm guarantees a competitive ratio of 0.74500001, improving on 0.7258. This remains below the I-I-D upper bound of about 0.74544.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.