Study of Modern Hiring Strategies Stemmed from the Secretary Problem
DOI:
https://doi.org/10.54097/ghmvha73Keywords:
secretary problem, parallelization, Poisson Process, Nash equilibrium.Abstract
The use of the optimal stopping framework is becoming more relied upon in contemporary hiring practices. Various models that are founded on the classical secretary problem emerge to get the best solutions in different circumstances. This review summarizes various articles on the same subject to explore the impact of various variants, including multiple choice, multiple references, parallelization, concurrent employment and multiple employers with strategic competition, on the quality and Hiring efficiency. This paper examines technical contributions, such as Poisson Process of finite arrivals, Primal-Dual linear programming of shared parallel quotas, dynamic programming of temporal coverage, Nash equilibrium to access competitiveness and analytic combinatorics of rank-based selectivity. Key findings indicate that strategic competition re-optimizes the optimal stopping threshold between 37% and 31% and concurrent employment is a mathematical requirement to obtain the same ratios of competition in dynamic environments. The synthesis offers a set of tools to design selective and resilient recruitment systems in the face of various distributional and structural uncertainty.
Downloads
References
[1] DISSER Y, FEARNLEY J, GAIRING M, et al. Recruiting secretaries with time: the advantage of simultaneous recruitment. Mathematics of Operations Research, 2020, 45(1): 323-352. DOI: https://doi.org/10.1287/moor.2019.0993
[2] SUN X, ZHANG J, ZHANG J. In parallel: multi-choice secretary problem: optimal observation-selection protocol//International Symposium on Algorithms and Computation (ISAAC). 2014. DOI: https://doi.org/10.1007/978-3-319-13075-0_52
[3] FELDMAN M, IZSAK R. Forming a good team: secretary problems and the supermodular degree. arXiv preprint, arXiv:1507.06199, 2017. DOI: https://doi.org/10.1137/1.9781611974782.109
[4] TURKIELTAUB MELO A. The decision to hire under uncertainty and competition: a work on various extensions of the secretary problem. Vancouver: University of British Columbia, 2025.
[5] BESBES O, KANORIA Y, KUMAR A. The multisecretary problems with several types. Operations Research, 2022. DOI: https://doi.org/10.1145/3490486.3538371
[6] LI Q, YU P. The secretary issue of numerous vacancies of job and batch arrival of candidates. Operations Research Letters, 2021, 49(4). DOI: https://doi.org/10.1016/j.orl.2021.05.014
[7] ARCHIBALD M, MARTÍNEZ C. The hiring problem and permutations. Discrete Mathematics Theoretical Computer Science (DMTCS), 2009. DOI: https://doi.org/10.46298/dmtcs.2731
[8] HELMI A, MARTÍNEZ C, PANHOLZER A. Hiring better than the m-th best candidate: records generalization in permutations. Discrete Mathematics and Theoretical Computer Science (DMTCS), 2014.
[9] FUJII K, YOSHIDA Y. Secretary problem of predictions and an order of choice. International Journal of Geometric Methods in Modern Physics 2024, 21: 05.
[10] KAPLAN H, MANSOUR Y, NASSIE S. Secretary problem and independent sampling with limited memory. Management Science, 2024, 70(3): 1582-1598.
[11] DUGHMI S, KLEINBERG R. The competitive secretary problem: the strategic candidates and the market equilibrium//ACM Symposium on Theory of Computing (STOC), 57th. 2025: 412-425.
Downloads
Published
Issue
Section
License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

