2017/06/22 by L. Bayón, L. Bayon, Bayon, L. +11
Computer Science · Decision Sciences · Mathematics · #Auction Theory and Applications #Cryptography and Data Security #FOS: Mathematics #Optimization and Search Problems #Probability (math.PR) #math.PR
paper · pdf · doi:10.48550/arxiv.1706.07185
arxiv created 2017/06/22 · openalex publication_date 2017/06/22 · arxiv updated 2017/06/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 candidate is the best or the worst.