A Sequential Model for High-Volume Recruitment Under Random Yields

References

• Anily S, Beja A, Mendel A (2002) Optimal lot sizes with geometric production yield and rigid demand. Oper. Res. 50(3):424–432.Link, Google Scholar
• Arnold BC, Groeneveld RA (1979) Bounds on expectations of linear systematic statistics based on dependent samples. Ann. Statist. 7(1):220–223.Crossref, Google Scholar
• Balseiro S, Besbes O, Pizarro D (2023) Survey of dynamic resource-constrained reward collection problems: Unified model and analysis. Oper. Res., ePub ahead of print May 9, https://doi.org/10.1287/opre.2023.2441.Google Scholar
• Barr DR, Sherrill ET (1999) Mean and variance of truncated normal distributions. Amer. Statist. 53(4):357–361.Crossref, Google Scholar
• Bertsimas D, Natarajan K, Teo CP (2006) Tight bounds on expected order statistics. Probab. Engrg. Inform. Sci. 20(4):667–686.Crossref, Google Scholar
• Boudreau J, Hopp W, McClain J, Thomas L (2003) On the interface between operations and human resources management. Manufacturing Service Oper. Management 5(3):179–202.Link, Google Scholar
• Brown DB, Smith JE, Sun P (2010) Information relaxations and duality in stochastic dynamic programs. Oper. Res. 58(4):785–801.Link, Google Scholar
• Cronbach LJ, Gleser GC (1965) Psychological Tests and Personnel Decisions (University of Illinois Press, Urbana).Google Scholar
• De Corte W (1998) Estimating and maximizing the utility of sequential selection decisions with a probationary period. British J. Math. Statist. Psych. 51(1):101–121.Crossref, Google Scholar
• De Corte W, Lievens F, Sackett PR (2006) Predicting adverse impact and mean criterion performance in multistage selection. J. Appl. Psych. 91(3):523–537.Crossref, Google Scholar
• DeGroot MH (2004) Optimal Statistical Decision (Wiley, Hoboken, NJ).Crossref, Google Scholar
• Du L, Li Q (2020) A data-driven approach to high-volume recruitment: Application to student admission. Manufacturing Service Oper. Management 22(5):942–957.Link, Google Scholar
• Freeman PR (1983) The secretary problem and its extensions: A review. Internat. Statist. Rev. 51(2):189–206.Crossref, Google Scholar
• Gallego G, van Ryzin G (1994) Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Sci. 40(8):999–1020.Link, Google Scholar
• Gallego G, Wang R (2020) On the soft k-prophet problem. Working paper, Hong Kong University of Science and Technology, Hong Kong.Google Scholar
• Goldberg DA, Katz-Rogozhnikov DA, Lu Y, Sharma M, Squillane MS (2016) Asymptotic optimality of constant-order policies for lost sales inventory models with large lead times. Math. Oper. Res. 41(3):898–913.Link, Google Scholar
• Goldreich O (2017) Introduction to Property Testing (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Grosfeld-Nir A, Gerchak Y, He Q (2000) Manufacturing to order with random yield and costly inspection. Oper. Res. 48(5):761–767.Link, Google Scholar
• Hayton E (2018) 5 ways technology can help with high volume recruiting. Accessed July 21, 2020, https://harver.com/blog/high-volume-recruiting/.Google Scholar
• Henig M, Gerchak Y (1990) The structure of periodic review policies in the presence of random yield. Oper. Res. 38(4):634–643.Link, Google Scholar
• Jasin S (2014) Reoptimization and self-adjusting price control for network revenue management. Oper. Res. 62(5):999–1020.Link, Google Scholar
• Kao RC, Rowan TC (1959) A model for personnel recruiting and selection. Management Sci. 5(2):192–203.Link, Google Scholar
• Kuris G (2022) How to approach law school seat deposits? Accessed July 28, https://www.usnews.com/education/blogs/law-admissions-lowdown/articles/how-to-approach-law-school-seat-deposits.Google Scholar
• Li Q, Zheng S (2006) Joint inventory replenishment and pricing control for systems with uncertain yield and demand. Oper. Res. 54(4):696–705.Link, Google Scholar
• Li Q, Xu H, Zheng S (2008) Periodic-review inventory systems with random yield and demand: Bounds and heuristics. IIE Trans. 40(4):434–444.Google Scholar
• Min J (2019) 4 innovative strategies for high volume hiring. Accessed July 21, 2020, https://ideal.com/high-volume-hiring/.Google Scholar
• Moore J (2018) A modern take on data-driven recruiting from a Google recruiting leader. Accessed July 21, 2020, https://hire.google.com/articles/a-modern-take-on-data-driven-recruiting/.Google Scholar
• Powell WB (2007) Approximate Dynamic Programming (John Wiley and Sons, New York).Crossref, Google Scholar
• Royston JP (1982) Algorithm AS 177: Expected normal order statistics (exact and approximate). J. Royal Statist. Soc. Ser. C.: Appl. Statist. 31(2):161–165.Google Scholar
• Shao J (2003) Mathematical Statistics (Springer, New York).Crossref, Google Scholar
• Spivey Consulting (2023) Know your law school deposit deadlines. Accessed May 4, 2023, https://www.spiveyconsulting.com/blog-post/know-your-law-school-deposit-deadlines/.Google Scholar
• van der Vaart AW, Wellner JA (2013) Weak Convergence and Empirical Process (Springer Science and Business Media, Berlin).Google Scholar
• Vulcano G, van Ryzin G, Maglaras C (2002) Optimal dynamic auctions for revenue management. Management Sci. 48(11):1388–1407.Link, Google Scholar
• Xin L, Goldberg DA (2016) Optimality gap of constant-order policies decays exponentially in the lead time for lost sales models. Oper. Res. 64(6):1556–1565.Link, Google Scholar
• Yano C, Lee HL (1995) Lot sizing with random yields: A review. Oper. Res. 43(2):311–334.Link, Google Scholar