The prophet and secretary problems demonstrate online scenarios involving the optimal stopping theory. In a typical prophet or secretary problem, selection decisions are assumed to be immediate and irrevocable. However, many online settings accommodate some degree of revocability. To study such scenarios, we introduce the ℓ-out-of-k setting, where the decision maker can select up to k elements immediately and irrevocably, but her performance is measured by the top ℓ elements in the selected set. Equivalently, the decision makes can hold up to ℓ elements at any given point in time, but can make up to k − ℓ returns as new elements arrive. We give upper and lower bounds on the competitive ratio of ℓ-out-of-k prophet and secretary scenarios. For ℓ-out-of-k prophet scenarios we provide a single-sample algorithm with competitive ratio 1 − ℓ · e−Θ (k− k ℓ)2 . The algorithm is a single-threshold algorithm, which sets a threshold that equals the (ℓ+ 2 k )th highest sample, and accepts all values exceeding this threshold, up to reaching capacity k. On the other hand, we show that this result is tight if the number of possible returns is linear in ℓ (i.e., k − ℓ = Θ(ℓ)). In particular, we show that no single-sample algorithm obtains a competitive ratio better than 1 − 2−( k 2 + k 1 +1) . We also present a deterministic single-threshold algorithm for the 1-out-of-k prophet setting which obtains a competitive ratio of 1 − 3 2 · e−k/6, knowing only the distribution of the maximum value. This result improves the result of [Assaf & Samuel-Cahn, J. of App. Prob., 2000]. Furthermore, we show that no ℓ-out-of-k prophet algorithm, even one that has full information on the distributions of values from the outset, can achieve a better competitive ratio than 1 − (2k+2)! . 1 For ℓ-out-of-k secretary scenarios, we provide an algorithm with a competitive ratio 1 − ℓe− 2k+2−ln 4ℓℓ − e−k/6 The algorithm divides the values into ℓ + 1 segments, numbered from 0 to ℓ. In the j-th segment the algorithm . accepts the ith element if it belongs to the j highest values seen so far, and the capacity k is not exhausted. On the negative side, we show that no ℓ-out-of-k secretary algorithm achieves a better competitive ratio than 1 − e 1 k + 2 3n . Beyond the contribution to online algorithms and optimal stopping theory, our results have implications to mechanism design. In particular, we use our prophet algorithms to derive overbooking mechanisms with good welfare and revenue guarantees; these are mechanisms that sell more items than the seller's capacity, then allocate to the agents with the highest values among the selected agents. Our results are summarized in Tables 1 and 2 below.
|Title of host publication||ACM EC 2018 - Proceedings of the 2018 ACM Conference on Economics and Computation|
|Publisher||Association for Computing Machinery, Inc|
|Number of pages||2|
|State||Published - 11 Jun 2018|
|Event||19th ACM Conference on Economics and Computation, EC 2018 - Ithaca, United States|
Duration: 18 Jun 2018 → 22 Jun 2018
|Name||ACM EC 2018 - Proceedings of the 2018 ACM Conference on Economics and Computation|
|Conference||19th ACM Conference on Economics and Computation, EC 2018|
|Period||18/06/18 → 22/06/18|
Bibliographical noteFunding Information:
This work was partially supported by the European Research Council under the European Union's Seventh Framework Programme (FP7/2007-2013) / ERC grant agreement number 337122, by the Israel Science Foundation (grant number 317/17), and by JSPS KAKENHI Grant Numbers JP17H00761 and JP17H04695.
© 2018 Association for Computing Machinery.
ASJC Scopus subject areas
- Computer Science (miscellaneous)
- Statistics and Probability
- Computational Mathematics
- Economics and Econometrics