Prophet Inequalities via the Expected Competitive Ratio
Tomer Ezra, Stefano Leonardi, Rebecca Reiffenh\"auser, Matteo, Russo, Alexandros Tsigonias-Dimitriadis

TL;DR
This paper introduces the Expected Ratio (EoR) as a new, more robust performance measure for prophet inequalities under downward-closed constraints, establishing its relation to the traditional Ratio of Expectations (RoE) and deriving new bounds.
Contribution
It demonstrates that EoR is a stronger benchmark than RoE and provides reductions linking the two, enabling the transfer of known RoE results to EoR in various settings.
Findings
EoR and RoE are within a constant factor for any constraint.
RoE is at least a constant fraction of EoR, but not vice versa.
Reductions allow applying RoE results to EoR benchmarks.
Abstract
We consider prophet inequalities under downward-closed constraints. In this problem, a decision-maker makes immediate and irrevocable choices on arriving elements, subject to constraints. Traditionally, performance is compared to the expected offline optimum, called the \textit{Ratio of Expectations} (RoE). However, RoE has limitations as it only guarantees the average performance compared to the optimum, and might perform poorly against the realized ex-post optimal value. We study an alternative performance measure, the \textit{Expected Ratio} (EoR), namely the expectation of the ratio between algorithm's and prophet's value. EoR offers robust guarantees, e.g., a constant EoR implies achieving a constant fraction of the offline optimum with constant probability. For the special case of single-choice problems the EoR coincides with the well-studied notion of probability of selecting the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAuction Theory and Applications · Optimization and Search Problems · Advanced Bandit Algorithms Research
