Duration of a secretary problem
Consider the classical secretary problem (rank-based no-information case, equally probable arrival orders of ranks, one selection, no recall) with \(n\) candidates and let a success of the decision maker be defined by the selection of one of the \(s\) best candidates among the \(n\). This article studies the optimal rule (maximizing the success probability) as well as the expected time \(T\) of selection of a candidate. As the author shows, his stronger results extend and complement some of the results obtained by \textit{M. P. Quine} and \textit{J. S. Law} [ibid. 33, No. 3, 630-639 (1996; Zbl 0871.60037)] who were seemingly unaware of the author's previous work (co-authored) on this subject. The following alternative approach to determine \(E(T)\) seems worth mentioning, and may be new. Define a \(k\)-leader as a candidate which has relative rank \(<k\), and call a \(k\)-leader relevant if it appears at or after cutoff-time \(t_k\). Now note that \(T> t\) if and only if no relevant leader appears up to time \(t\). The probability of this event is just the value of the probability generating function of the counting variable \(N(t)=\#\)\{relevant leaders up to time \(t\)\} at 0. By Rényi's theorem on relative ranks, however, candidate \(j\), \(j> k\), is a \(k\)-leader with probability \(k/j\), independent of preceding ranks, so that the pgf of \(N(t)\) splits into a tractable product.
- 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
- 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)