Probabilities of choosing applicants of arbitrary rank in the secretary problem

DOI10.2307/3214276zbMath0621.60053OpenAlexW2314237616MaRDI QIDQ3757078

Peter A. Rogerson

Publication date: 1987

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

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

zbMATH Keywords

order statisticsoptimal stopping ruleNumerical resultsSecretary Problemdecision numbers

Mathematics Subject Classification ID

Order statistics; empirical distribution functions (62G30) Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (2)

An optimal algorithm for stopping on the element closest to the center of an interval ⋮ Secretary problem with hidden information; searching for a high merit candidate

This page was built for publication: Probabilities of choosing applicants of arbitrary rank in the secretary problem