A central object of study in optimal stopping theory is the single-choice prophet inequality for independent and identically distributed random variables: given a sequence of random variables [Formula: see text] drawn independently from the same distribution, the goal is to choose a stopping time τ such that for the maximum value of α and for all distributions, [Formula: see text]. What makes this problem challenging is that the decision whether [Formula: see text] may only depend on the values of the random variables [Formula: see text] and on the distribution F. For a long time, the best known bound for the problem had been [Formula: see text], but recently a tight bound of [Formula: see text] was obtained. The case where F is unknown, such that the decision whether [Formula: see text] may depend only on the values of the random variables [Formula: see text], is equally well motivated but has received much less attention. A straightforward guarantee for this case of [Formula: see text] can be derived from the well-known optimal solution to the secretary problem, where an arbitrary set of values arrive in random order and the goal is to maximize the probability of selecting the largest value. We show that this bound is in fact tight. We then investigate the case where the stopping time may additionally depend on a limited number of samples from F, and we show that, even with o(n) samples, [Formula: see text]. On the other hand, n samples allow for a significant improvement, whereas [Formula: see text] samples are equivalent to knowledge of the distribution: specifically, with n samples, [Formula: see text] and [Formula: see text], and with [Formula: see text] samples, [Formula: see text] for any [Formula: see text].
The Infinite Secretary Problem as the Limit of the Finite Problem
