Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Making the Cut: A Bandit-based Approach to Tiered Interviewing   Given a huge set of applicants, how should a firm allocate sequential resume
screenings, phone interviews, and in-person site visits? In a tiered interview
process, later stages (e.g., in-person visits) are more informative, but also
more expensive than earlier stages (e.g., resume screenings). Using accepted
hiring models and the concept of structured interviews, a best practice in
human resources, we cast tiered hiring as a combinatorial pure exploration
(CPE) problem in the stochastic multi-armed bandit setting. The goal is to
select a subset of arms (in our case, applicants) with some combinatorial
structure. We present new algorithms in both the probably approximately correct
(PAC) and fixed-budget settings that select a near-optimal cohort with provable
guarantees. We show via simulations on real data from one of the largest
US-based computer science graduate programs that our algorithms make better
hiring decisions or use less budget than the status quo.

32
The categories of this paper are: atom-ph
26
The categories of this paper are: bayes-an
19
The categories of this paper are: eess
34
The categories of this paper are: chem-ph
9
The categories of this paper are: nlin
4
The categories of this paper are: cond-mat
33
The categories of this paper are: plasm-ph
5
The categories of this paper are: gr-qc
6
The categories of this paper are: astro-ph
37
The categories of this paper are: supr-con
8
The categories of this paper are: hep-ex
31
The categories of this paper are: ao-sci
36
The categories of this paper are: cmp-lg
35
The categories of this paper are: mtrl-th
22
The categories of this paper are: chao-dyn
12
The categories of this paper are: nucl-th