English

Hiring Strategies

Computer Science and Game Theory 2025-06-03 v1 Combinatorics Probability Physics and Society

Abstract

We investigate the hiring problem where a sequence of applicants is sequentially interviewed, and a decision on whether to hire an applicant is immediately made based on the applicant's score. For the maximal and average improvement strategies, the decision depends on the applicant's score and the scores of all employees, i.e., previous successful applicants. For local improvement strategies, an interviewing committee randomly chosen for each applicant makes the decision depending on the score of the applicant and the scores of the members of the committee. These idealized hiring strategies capture the challenges of decision-making under uncertainty. We probe the average score of the best employee, the probability of hiring all first NN applicants, the fraction of superior companies in which, throughout the evolution, every hired applicant has a score above expected, etc.

Keywords

Cite

@article{arxiv.2412.10490,
  title  = {Hiring Strategies},
  author = {P. L. Krapivsky},
  journal= {arXiv preprint arXiv:2412.10490},
  year   = {2025}
}

Comments

12 pages, 3 figures

R2 v1 2026-06-28T20:34:42.030Z