2017
DOI: 10.1137/15m1029394
|View full text |Cite
|
Sign up to set email alerts
|

Prophet Secretary

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

2
36
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 50 publications
(38 citation statements)
references
References 11 publications
2
36
0
Order By: Relevance
“…us, making it easier to extract revenue by o ering to good customers rst. Furthermore, this bound also matches the approximation guarantee obtained by Esfandiari et al [10], who also consider the random arrival model, but in their mechanism the sequence of prices depends on the arrival order of customers, and it is therefore adaptive (according to the de nition in this paper). Besides the natural application of our nonadaptive se ing, it is interesting to note that one can achieve this approximation factor in the random arrival model without using adaptivity.…”
Section: Introductionsupporting
confidence: 86%
“…us, making it easier to extract revenue by o ering to good customers rst. Furthermore, this bound also matches the approximation guarantee obtained by Esfandiari et al [10], who also consider the random arrival model, but in their mechanism the sequence of prices depends on the arrival order of customers, and it is therefore adaptive (according to the de nition in this paper). Besides the natural application of our nonadaptive se ing, it is interesting to note that one can achieve this approximation factor in the random arrival model without using adaptivity.…”
Section: Introductionsupporting
confidence: 86%
“…Interestingly this bound matches the bound of Chawla et al [10] for the so called sequential posted price mechanisms (SPM) in which the arrival order of the random variables is chosen by the gambler rather than at random. Furthermore the bound also matches that of Esfandiari et al [17], however, Mathematics of Operations Research 00(0), pp. 000-000, ©0000 INFORMS their bound is obtained through a stopping rule that is adaptive.…”
Section: Related Worksupporting
confidence: 83%
“…We refer the reader to the survey of Hill and Kertz [24] for more results on prophet inequalities. More recently, Esfandiari et al [17] considered an interesting combination of the prophet inequality and the secretary problem, now known as the prophet secretary problem. This is basically a prophet inequality but the the random variables are presented in a random order to the gambler.…”
mentioning
confidence: 99%
“…Surprisingly, Ehsani et al [2018] show that the same bound of 1−1/e can even be obtained with a single threshold. This may appear to contradict the upper bound bound of 1 2 of Esfandiari et al [2015], however, the subtle issue is that they allow to break ties at random. In particular, if in the previous example the gambler sets T = 1 and if there is a tie, she stops with probability 1/n.…”
Section: Prophet Secretarymentioning
confidence: 96%
“…In this version, the random variables are shown to the gambler in random order, as in the secretary problem. The problem was first studied by Esfandiari et al [2015] who found a bound of 1 − 1/e. Their algorithm defines a nonincreasing sequence of n thresholds that only depend on the expecta-• 63 tion of the maximum of the random variables, and the gambler stops whenever the currently sampled value surpasses the threshold corresponding to the current time.…”
Section: Introductionmentioning
confidence: 99%