Remarks on the Secretary Problem
The classical secretary problem is considered: A given number of candidates are to be interviewed for a certain position. They present themselves one by one in random order. We can either hire the \(i\)-th candidate according to the (relative) rank among those candidates already interviewed, in which case the process stops, or go on to the next, in which case the \(i\)-th cannot be recalled. One of the candidates has to be selected. If the (absolute) rank of the selected one among all candidates is \(x\), our loss will be \(f(x)\), where \(f\) is a real function defined on the positive integers. We want to choose a stopping rule that will minimize the expected loss (asymptotically as \(n\to\infty\)). The following loss functions are dealt with: \(f(x) = 0\) if \(x=1\) and \(f(x)=1\) otherwise; \(f(x)=x\); and \(f(x)=x(x+1)\cdots (x+a-1)\) with some integer \(a\geq 1\). In the latter case, by some ``heroic heuristics the problem is reduced to solving a simple differential equation. Using the same argument, the case \(f(x)=x^ 2\) is also studied. Finally, a slightly modified problem is investigated: Instead of appearing one by one in random order, in each step only the best and the worst of the remaining candidates are assumed to show with probability 1/2 each.
- Embedding optimal selection problems in a Poisson process
- The senior and junior secretaries problem
- Strategies in the secretary problem
- Who solved the secretary problem? With comments and a rejoinder by the author
- Score-based secretary problem
- Avoiding patterns and making the best choice
- The solution of a generalized secretary problem via analytic expressions
- Progressive stopping heuristics that excel in individual and competitive sequential search
- The secretary recommendation problem
- The secretary problem with biased arrival order via a Mallows distribution
- A unified approach for solving sequential selection problems
- Weber's optimal stopping problem and generalizations
- A new look at the returning secretary problem
- Minimal expected ranks for the secretary problems with uncertain selection
- Hiring above the m-th best candidate: a generalization of records in permutations
- The secretary problem from the applicant's point of view
- The hiring problem and permutations
- Extremal processes, secretary problems and the 1/e law
- scientific article; zbMATH DE number 3945177 (Why is no real title available?)
- scientific article; zbMATH DE number 3988379 (Why is no real title available?)
- Probabilities of choosing applicants of arbitrary rank in the secretary problem
- scientific article; zbMATH DE number 4033475 (Why is no real title available?)
- Analysis of the ``hiring above the median selection strategy for the hiring problem
- The Secretary's Packet Problem
- scientific article; zbMATH DE number 4096506 (Why is no real title available?)
- scientific article; zbMATH DE number 67285 (Why is no real title available?)
- scientific article; zbMATH DE number 67286 (Why is no real title available?)
- On Multiple Choice Secretary Problems
- Secretary problem
- The secretary problem: minimizing the expected rank with I.I.D. random variables
- Exact results for a secretary problem
- scientific article; zbMATH DE number 4121248 (Why is no real title available?)
- The Secretary Problem—An Update
- Average number of candidates surveyed by the headhunter in the recruitment
- Secretary problem with vanishing objects
- scientific article; zbMATH DE number 7077336 (Why is no real title available?)
- Optimal stopping for dynamic recruitment problem with probabilistic loss of candidates
- The ``thirty-seven percent rule and the secretary problem with relative ranks
- What is Known About Robbins' Problem?
- Bilateral approach to the secretary problem
- Optimal stopping methodology for the secretary problem with random queries
- Expected duration of the no-information minimum rank problem
This page was built for publication: Remarks on the Secretary Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988370)