On submodular prophet inequalities and correlation gap

Open Webpage

Chandra Chekuri, Vasilis Livanos

Published: 2024, Last Modified: 25 Jan 2025Theor. Comput. Sci. 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•Significant improvement of submodular prophet inequality guarantees over past work.•Polynomial-time algorithms that achieve these guarantees.•Extension to feasibility constraints beyond matroids.•Fine-grained correlation gap for non-monotone submodular functions.