Duration of a secretary problem

DOI10.2307/3215394MaRDI QIDQ4358605zbMATH OpenOpenAlexFDO

Authors 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

cutoff-strategiescutoff-timeexpected durationprobability generating functionsecretary problem

Mathematics Subject Classification ID

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

Recommendations

• Embedding optimal selection problems in a Poisson process
• scientific article; zbMATH DE number 3947461
• A unified approach to a class of best choice problems with an unknown number of options
• Best-choice problems involving recall and uncertainty of selection when the number of observations is random
• Probabilities of choosing applicants of arbitrary rank in the secretary problem
• Secretary problems as a source of benchmark bounds

Cited in

(9)

• Analysis of heuristic solutions to the best choice problem.
• Shelf life of candidates in the generalized secretary problem
• A unified approach for solving sequential selection problems
• Sequential selections with minimization of failure
• The Temp Secretary Problem
• Extremal processes, secretary problems and the 1/e law
• scientific article; zbMATH DE number 3896008 (Why is no real title available?)
• Average number of candidates surveyed by the headhunter in the recruitment
• Expected duration of the no-information minimum rank problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4358605)