Hiring Strategies
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915316386234368 |
|---|---|
| author | Krapivsky, P. L. |
| author_facet | Krapivsky, P. L. |
| contents | 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 $N$ applicants, the fraction of superior companies in which, throughout the evolution, every hired applicant has a score above expected, etc. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_10490 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Hiring Strategies Krapivsky, P. L. Computer Science and Game Theory Combinatorics Probability Physics and Society 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 $N$ applicants, the fraction of superior companies in which, throughout the evolution, every hired applicant has a score above expected, etc. |
| title | Hiring Strategies |
| topic | Computer Science and Game Theory Combinatorics Probability Physics and Society |
| url | https://arxiv.org/abs/2412.10490 |