Duration of a secretary problem

DOI10.2307/3215394zbMath0883.60040OpenAlexW4246805705MaRDI QIDQ4358605

Geoffrey F. Yeo

Publication date: 16 March 1998

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3215394

zbMATH Keywords

probability generating functionsecretary problemexpected durationcutoff-strategiescutoff-time

Mathematics Subject Classification ID

Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (6)

Expected duration of the no-information minimum rank problem ⋮ Average number of candidates surveyed by the headhunter in the recruitment ⋮ A unified approach for solving sequential selection problems ⋮ Sequential selections with minimization of failure ⋮ Shelf life of candidates in the generalized secretary problem ⋮ Analysis of heuristic solutions to the best choice problem.

This page was built for publication: Duration of a secretary problem