2017
DOI: 10.1007/s10878-017-0203-4
|View full text |Cite
|
Sign up to set email alerts
|

The Best-or-Worst and the Postdoc problems

Abstract: We consider two variants of the secretary problem, the Best-or-Worst and the Postdoc problems, which are closely related. First, we prove that both variants, in their standard form with binary payoff 1 or 0, share the same optimal stopping rule. We also consider additional cost/perquisites depending on the number of interviewed candidates. In these situations the optimal strategies are very different. Finally, we also focus on the Best-or-Worst variant with different payments depending on whether the selected … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
18
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 16 publications
(18 citation statements)
references
References 15 publications
0
18
0
Order By: Relevance
“…If ( ) ∼ ℳ( ) then lim ( ( )) = ( ).Proof. The proof is straightforward and analogous to that presented in[3] for functions of a real variable and domain [0, ] and ( ) = ( ).…”
mentioning
confidence: 80%
“…If ( ) ∼ ℳ( ) then lim ( ( )) = ( ).Proof. The proof is straightforward and analogous to that presented in[3] for functions of a real variable and domain [0, ] and ( ) = ( ).…”
mentioning
confidence: 80%
“…This is exemplified in a study of planning medical treatments (Bruss [15]) where a convincing way to comply with ethical constraints is to pursue a last success. Additional flexibility can also be obtained to some extent by adapting the notion of a last success to more than one selection, by focussing on the best-or-second best, as in Ano and Ando [16], Ano et al [17], and Bayón et al [18], looking at multiple stopping versions as in Tamaki [19] and Kurushima and Ano [20], and also by allowing for missing observations, as in the work of Ramsey [21].…”
Section: Last Success Problemsmentioning
confidence: 99%
“…The following theorem (see [2,Section 4]) establishes the relation between the optimal strategies in the Best-or-Worst problem and the Postdoc problem when the number of objects in known. Theorem 1.…”
Section: The Relation Between the Best-or-worst Problem And The Postdmentioning
confidence: 99%