Hiring Under Uncertainty

In this paper we introduce the hiring under uncertainty problem to model the questions faced by hiring committees in large enterprises and universities alike. Given a set of $n$ eligible candidates, the decision maker needs to choose the sequence of candidates to make offers so as to hire the $k$ best candidates. However, candidates may choose to reject an offer (for instance, due to a competing offer) and the decision maker has a time limit by which all positions must be filled. Given an estimate of the probabilities of acceptance for each candidate, the hiring under uncertainty problem is to design a strategy of making offers so that the total expected value of all candidates hired by the time limit is maximized. We provide a 2-approximation algorithm for the setting where offers must be made in sequence, an 8-approximation when offers may be made in parallel, and a 10-approximation for the more general stochastic knapsack setting with finite probes.

[1]  Fabrizio Grandoni,et al.  Improved Approximation Algorithms for Stochastic Matching , 2015, ESA.

[2]  R. Ravi,et al.  Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[3]  Amin Saberi,et al.  Stochastic Submodular Maximization , 2008, WINE.

[4]  Aravind Srinivasan,et al.  Improved Bounds in Stochastic Matching and Optimization , 2015, APPROX-RANDOM.

[5]  Will Dobbie,et al.  Teacher Characteristics and Student Achievement : Evidence from Teach For America , 2011 .

[6]  Michael Luca,et al.  Supplemental Appendix for : Productivity and Selection of Human Capital with Machine Learning , 2016 .

[7]  Jonah E. Rockoff,et al.  Teacher Applicant Hiring and Teacher Performance: Evidence from Dc Public Schools , 2016, Journal of Public Economics.

[8]  Sendhil Mullainathan,et al.  Machine Learning: An Applied Econometric Approach , 2017, Journal of Economic Perspectives.

[9]  Robert D. Kleinberg.  A multiple-choice secretary algorithm with applications to online auctions , 2005, SODA '05.

[10]  A NOTE ON BRUSS' STOPPING PROBLEM WITH RANDOM AVAILABILITY (Decision Theory in Mathematical Modelling) , 1999 .

[11]  S. M. Samuels,et al.  Optimal selection based on relative rank (the “secretary problem”) , 1964 .

[12]  Atri Rudra,et al.  When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings , 2010, Algorithmica.

[13]  Anupam Gupta,et al.  Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions , 2016, SODA.

[14]  M. Tamaki.  Minimal expected ranks for the secretary problems with uncertain selection , 2000 .

[15]  Jan Vondrák,et al.  Adaptivity and approximation for stochastic packing problems , 2005, SODA '05.

[16]  Will Ma.  Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Full Version , 2013, SODA 2014.

[17]  Jan Vondrák,et al.  Approximating the stochastic knapsack problem: the benefit of adaptivity , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[18]  M. H. Smith,et al.  A secretary problem with uncertain employment , 1975, Journal of Applied Probability.

[19]  Thomas J. Kane,et al.  Estimating Teacher Impacts on Student Achievement: An Experimental Evaluation , 2008 .

[20]  Ashish Goel,et al.  Improved approximation results for stochastic knapsack problems , 2011, SODA '11.

[21]  Mitsushi Tamaki.  A Secretary Problem with Uncertain Employment and Best Choice of Available Candidates , 1991, Oper. Res..

[22]  Panagiotis G. Ipeirotis,et al.  Hiring Behavior Models for Online Labor Markets , 2015, WSDM.