Expected duration of the no-information minimum rank problem

DOI10.1016/J.SPL.2020.108950zbMath1455.60065OpenAlexW3088856402MaRDI QIDQ826693

Simon Demers

Publication date: 6 January 2021

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2020.108950

zbMATH Keywords

optimal stoppingsequential decisionsearch time

Mathematics Subject Classification ID

Extreme value theory; extremal stochastic processes (60G70) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Related Items (2)

Average number of candidates surveyed by the headhunter in the recruitment ⋮ Sequential selections with minimization of failure

Cites Work

• On an optimal stopping problem of Gusein-Zade
• Who solved the secretary problem
• Analysis of heuristic solutions to the best choice problem.
• A unified approach for solving sequential selection problems
• Optimal selection based on relative rank (the 'Secretary Problem')
• Duration of a secretary problem
• Exact results for a secretary problem
• On Asymptotic Properties of Optimal Stopping Time
• Dynamic Programming and Decision Theory
• Unnamed Item

This page was built for publication: Expected duration of the no-information minimum rank problem