2018/10/26 by Simon Demers, Demers, Simon
Computer Science · Decision Sciences · Engineering · Mathematics · #Applications (stat.AP) #Auction Theory and Applications #Computation (stat.CO) #FOS: Computer and information sciences #Optimization and Search Problems #Scheduling and Optimization Algorithms #stat.AP #stat.CO
paper · pdf · doi:10.48550/arxiv.1810.11557
37 pages, 2 figures, 4 tables. This version contains important corrections and additional extensions
openalex publication_date 2018/10/26 · arxiv created 2019/12/11 · arxiv updated 2019/12/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Optimal stopping problems give rise to random distributions describing how many applicants the decision-maker will sample or interview before choosing one, a quantity sometimes referred to as the search time or process duration. This research note surveys several variants of optimal stopping problems, extends earlier results in various directions, and shows how many interviews are expected to be conducted in various settings. The focus is on problems that require a decision-maker to choose a candidate from a pool of sequential applicants with no recall, in the vein of previously studied Cayley-Moser, Secretary and Sultan's Dowry problems.