In the prophet inequality problem, a gambler faces a sequence of items arriving online with
values drawn independently from known distributions. On seeing an item, the gambler must …

In the classical prophet inequality, a gambler faces a sequence of items, whose values are
drawn independently from known distributions. Upon the arrival of each item, its value is …

We study the prophet secretary problem, a well-studied variant of the classic prophet
inequality, where values are drawn from independent known distributions but arrive in …

Abstract The Prophet Inequality and Pandora's Box problems are fundamental stochastic
problem with applications in Mechanism Design, Online Algorithms, Stochastic Optimization …

We take a unifying approach to single selection optimal stopping problems with random
arrival order and independent sampling of items. In the problem we consider, a decision …

Prophet inequalities consist of many beautiful statements that establish tight performance
ratios between online and offline allocation algorithms. Typically, tightness is established by …

The prophet secretary problem is a combination of the prophet inequality and the secretary
problem, where elements are drawn from known independent distributions and arrive in …

In a prophet inequality problem, n independent random variables are presented to a
gambler one by one. The gambler decides when to stop the sequence and obtains the most …

Prophet inequalities are a central object of study in optimal stopping theory. A gambler is
sent values online, sampled from an instance of independent distributions, in an adversarial …

In the stochastic set cover problem (Grandoni et al., FOCS '08), we are given a collection S
of m sets over a universe U of size N, and a distribution D over elements of U. The algorithm …