Average number of candidates surveyed by the headhunter in the recruitment

DOI10.14708/ma.v49i1.7082zbMath1499.60128OpenAlexW4200113366MaRDI QIDQ5064473

Marlena Ernst, Krzysztof J. Szajowski

Publication date: 16 March 2022

Published in: Mathematica Applicanda (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14708/ma.v49i1.7082

zbMATH Keywords

Markov processdurationsecretary problemoptimal stopping problembest choice problemuncertain employmentdowry hunter problem

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Related Items (1)

Sequential selections with minimization of failure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Expected duration of the no-information minimum rank problem
• Selection of nonextremal candidates from a random sequence
• Who solved the secretary problem
• Analysis of heuristic solutions to the best choice problem.
• Sum the odds to one and stop
• Full-information best choice game with hint
• A unified approach for solving sequential selection problems
• Hint, extortion, and guessing games in the best choice problem
• A new look at the returning secretary problem
• The optimal value of markov stopping problems with one-step look ahead policy
• A secretary problem with uncertain employment
• Duration of a secretary problem
• Selecting a sequence of last successes in independent trials
• On Asymptotic Properties of Optimal Stopping Time
• The postdoc variant of the secretary problem
• The Sum-the-Odds Theorem with Application to a Stopping Game of Sakaguchi
• New developments of the odds theorem
• Optimal Sequential Procedures when More Than one Stop is Required

This page was built for publication: Average number of candidates surveyed by the headhunter in the recruitment