# Learning to Screen

**Authors:** Alon Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, and Shay Moran

arXiv: 1902.04741 · 2019-06-03

## TL;DR

This paper studies online candidate screening for optimal recruitment, proposing algorithms that minimize retained candidates while ensuring the best matches, with improved bounds when prior training data is available.

## Contribution

It introduces a novel online assignment model for candidate screening and provides tight bounds on retention, showing significant improvements with training data.

## Key findings

- Optimal bounds on candidate retention for online matching.
- Training data reduces the number of retained candidates exponentially.
- Models applicable to large-scale recruitment scenarios.

## Abstract

Imagine a large firm with multiple departments that plans a large recruitment. Candidates arrive one-by-one, and for each candidate the firm decides, based on her data (CV, skills, experience, etc), whether to summon her for an interview. The firm wants to recruit the best candidates while minimizing the number of interviews. We model such scenarios as an assignment problem between items (candidates) and categories (departments): the items arrive one-by-one in an online manner, and upon processing each item the algorithm decides, based on its value and the categories it can be matched with, whether to retain or discard it (this decision is irrevocable). The goal is to retain as few items as possible while guaranteeing that the set of retained items contains an optimal matching.   We consider two variants of this problem: (i) in the first variant it is assumed that the $n$ items are drawn independently from an unknown distribution $D$. (ii) In the second variant it is assumed that before the process starts, the algorithm has an access to a training set of $n$ items drawn independently from the same unknown distribution (e.g.\ data of candidates from previous recruitment seasons). We give tight bounds on the minimum possible number of retained items in each of these variants. These results demonstrate that one can retain exponentially less items in the second variant (with the training set).

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1902.04741/full.md

## Figures

1 figure with captions in the complete paper: https://tomesphere.com/paper/1902.04741/full.md

## References

25 references — full list in the complete paper: https://tomesphere.com/paper/1902.04741/full.md

---
Source: https://tomesphere.com/paper/1902.04741