Prophet Inequalities via Linear Programming

Halil I. Bayrak, Mustafa \c{C}. P{\i}nar and Rakesh Vohra

Papers from arXiv.org

Abstract: Prophet inequalities bound the expected reward that can be obtained in a stopping problem by the optimal reward of its corresponding off-line version. We propose a systematic technique for deriving prophet inequalities for stopping problems associated with selecting a point in a polyhedron. It utilizes a reduced-form linear programming representation of the stopping problem. We illustrate the technique to derive a number of known results as well as some new ones. For instance, we prove a $\frac{1}{2}$-prophet inequality when the underlying polyhedron is an on-line polymatroid; one whose underlying submodular function depends upon the realized rewards. We also demonstrate a composition by the Minkowski sum property. If an $r-$ prophet inequality holds for polyhedra $P^1$ and $P^2$, it also holds for their Minkowski sum.

Date: 2026-02
References: Add references at CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2602.07542 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2602.07542

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().