IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v28y2026i1p290-307.html

A Rolling Recruitment Process Under Applicant Stochastic Departures

Author

Listed:
  • Chenyin Gong

    (HKUST Business School, The Hong Kong University of Science and Technology, Kowloon, Hong Kong)

  • Qing Li

    (HKUST Business School, The Hong Kong University of Science and Technology, Kowloon, Hong Kong)

Abstract

Problem definition : We study a rolling recruitment process in which applicants leave the system stochastically. Applicants arrive randomly over time, and each applicant is available for a random amount of time after they arrive. In each period, the recruiter must decide whether to stop or to wait . If the recruiter stops, he or she needs to determine how many offers to make and whom to make offers to, and the applicants who do not receive an offer will leave the system. If the recruiter waits, more applicants will be available in the next period, whereas some who arrived earlier will leave. Methodology/results : We model the process as a large-scale optimal stopping problem and show how the applicant qualifications, measured by scores, affect the recruiter’s optimal policy. Managerial implications : We find that the optimal stopping rule for each applicant’s score is a two-threshold policy. If the score exceeds the higher threshold, then the recruiter stops and makes an offer to the applicant and possibly to others. If the score falls below the lower threshold, then the recruiter also stops but makes no offer to the applicant. If the score is in between the two thresholds, the recruiter waits. We further explore the impact on an applicant’s likelihood of receiving an offer if his or her competitors become more qualified. When the score of another applicant increases, the recruiter may change from making an offer to an applicant to waiting or to instead making an offer to the other applicant whose score has increased. In other words, an applicant may be disadvantaged if he or she faces stronger competitors, which is expected. However, an applicant may also benefit from having stronger competitors. When the score of another applicant increases, the recruiter may change from not making an offer to an applicant to making an offer to both applicants. Overall, we provide valuable insights into the role of applicant qualifications in stopping decisions, propose methods for computing the optimal policy, and quantify the benefits of endogenously determining the stopping rule.

Suggested Citation

  • Chenyin Gong & Qing Li, 2026. "A Rolling Recruitment Process Under Applicant Stochastic Departures," Manufacturing & Service Operations Management, INFORMS, vol. 28(1), pages 290-307, January.
  • Handle: RePEc:inm:ormsom:v:28:y:2026:i:1:p:290-307
    DOI: 10.1287/msom.2024.1456
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/msom.2024.1456
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2024.1456?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Qing Li & Peiwen Yu & Xiaoli Wu, 2016. "Managing Perishable Inventories in Retailing: Replenishment, Clearance Sales, and Segregation," Operations Research, INFORMS, vol. 64(6), pages 1270-1284, December.
    2. Arshya Feizi & Anita Carson & Jillian Berry Jaeker & William Evan Baker, 2023. "To Batch or Not to Batch? Impact of Admission Batching on Emergency Department Boarding Time and Physician Productivity," Operations Research, INFORMS, vol. 71(3), pages 939-957, May.
    3. Alberto Vera & Siddhartha Banerjee, 2021. "The Bayesian Prophet: A Low-Regret Framework for Online Decision Making," Management Science, INFORMS, vol. 67(3), pages 1368-1391, March.
    4. Ying Zhang & Jayashankar M. Swaminathan, 2020. "Improved Crop Productivity Through Optimized Planting Schedules," Manufacturing & Service Operations Management, INFORMS, vol. 22(6), pages 1165-1180, November.
    5. Hyun-Soo Ahn & Derek D. Wang & Owen Q. Wu, 2021. "Asset Selling Under Debt Obligations," Operations Research, INFORMS, vol. 69(4), pages 1305-1323, July.
    6. Itai Ashlagi & Afshin Nikzad & Philipp Strack, 2023. "Matching in Dynamic Imbalanced Markets," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 90(3), pages 1084-1124.
    7. D. V. Lindley, 1961. "Dynamic Programming and Decision Theory," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 10(1), pages 39-51, March.
    8. Yingdong Lu & Jing-Sheng Song & David D. Yao, 2003. "Order Fill Rate, Leadtime Variability, and Advance Demand Information in an Assemble-to-Order System," Operations Research, INFORMS, vol. 51(2), pages 292-308, April.
    9. Mohammad Akbarpour & Shengwu Li & Shayan Oveis Gharan, 2020. "Thickness and Information in Dynamic Matching Markets," Journal of Political Economy, University of Chicago Press, vol. 128(3), pages 783-815.
    10. Thomas Kesselheim & Alexandros Psomas & Shai Vardi, 2024. "Technical Note—On Hiring Secretaries with Stochastic Departures," Operations Research, INFORMS, vol. 72(5), pages 2076-2081, September.
    11. Boris Epstein & Will Ma, 2024. "Selection and Ordering Policies for Hiring Pipelines via Linear Programming," Operations Research, INFORMS, vol. 72(5), pages 2000-2013, September.
    12. Gustavo Vulcano & Garrett van Ryzin & Costis Maglaras, 2002. "Optimal Dynamic Auctions for Revenue Management," Management Science, INFORMS, vol. 48(11), pages 1388-1407, November.
    13. Retsef Levi & Thomas Magnanti & Yaron Shaposhnik, 2024. "Scheduling with Testing of Heterogeneous Jobs," Management Science, INFORMS, vol. 70(5), pages 2934-2953, May.
    14. Lilun Du & Qing Li & Peiwen Yu, 2024. "A Sequential Model for High-Volume Recruitment Under Random Yields," Operations Research, INFORMS, vol. 72(1), pages 60-90, January.
    15. Nick Arnosti & Will Ma, 2023. "Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem," Operations Research, INFORMS, vol. 71(5), pages 1777-1788, September.
    16. Gregory P. Prastacos, 1983. "Optimal Sequential Investment Decisions Under Conditions of Uncertainty," Management Science, INFORMS, vol. 29(1), pages 118-134, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Süleyman Kerimov & Itai Ashlagi & Itai Gurvich, 2024. "Dynamic Matching: Characterizing and Achieving Constant Regret," Management Science, INFORMS, vol. 70(5), pages 2799-2822, May.
    2. Yeon-Koo Che, 2025. "Dynamic Market Design," Papers 2601.00155, arXiv.org.
    3. Afshin Nikzad & Philipp Strack, 2024. "Equity and Efficiency in Dynamic Matching: Extreme Waitlist Policies," Management Science, INFORMS, vol. 70(8), pages 5187-5207, August.
    4. Sebastian Perez-Salazar & Mohit Singh & Alejandro Toriello, 2025. "Robust Online Selection with Uncertain Offer Acceptance," Mathematics of Operations Research, INFORMS, vol. 50(3), pages 2226-2260, August.
    5. Mingwei Yang & Sophie H. Yu, 2026. "Online Metric Matching: Beyond the Worst Case," Operations Research, INFORMS, vol. 74(1), pages 130-140, January.
    6. Mertikopoulos, Panayotis & Nax, Heinrich H. & Pradelski, Bary S.R., 2024. "Quick or cheap? Breaking points in dynamic markets," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    7. Tao Zhang & Quanyan Zhu, 2022. "On Incentive Compatibility in Dynamic Mechanism Design With Exit Option in a Markovian Environment," Dynamic Games and Applications, Springer, vol. 12(2), pages 701-745, June.
    8. Chun, Young H. & Plante, Robert D. & Schneider, Helmut, 2002. "Buying and selling an asset over the finite time horizon: A non-parametric approach," European Journal of Operational Research, Elsevier, vol. 136(1), pages 106-120, January.
    9. Yi Wang & Yafei Yang & Zhaoxiang Qin & Yefei Yang & Jun Li, 2023. "A Literature Review on the Application of Digital Technology in Achieving Green Supply Chain Management," Sustainability, MDPI, vol. 15(11), pages 1-18, May.
    10. Liberopoulos, George, 2008. "On the tradeoff between optimal order-base-stock levels and demand lead-times," European Journal of Operational Research, Elsevier, vol. 190(1), pages 136-155, October.
    11. Qing Li & Peiwen Yu & Lilun Du, 2022. "Separation of Perishable Inventories in Offline Retailing Through Transshipment," Operations Research, INFORMS, vol. 70(2), pages 666-689, March.
    12. Hoen, K.M.R. & Güllü, R. & van Houtum, G.J. & Vliegen, I.M.H., 2011. "A simple and accurate approximation for the order fill rates in lost-sales Assemble-to-Order systems," International Journal of Production Economics, Elsevier, vol. 133(1), pages 95-104, September.
    13. Tom McGrath & Marc Schröder, 2025. "Competitive secretary problem," International Journal of Game Theory, Springer;Game Theory Society, vol. 54(1), pages 1-24, June.
    14. Ying-Ju Chen, 2017. "Optimal Dynamic Auctions for Display Advertising," Operations Research, INFORMS, vol. 65(4), pages 897-913, August.
    15. Xuhan Tian & Junmin (Jim) Shi & Xiangtong Qi, 2022. "Stochastic Sequential Allocations for Creative Crowdsourcing," Production and Operations Management, Production and Operations Management Society, vol. 31(2), pages 697-714, February.
    16. Fouad Ben Abdelaziz & Ray Saadaoui Mallek, 2018. "Multi-criteria optimal stopping methods applied to the portfolio optimisation problem," Annals of Operations Research, Springer, vol. 267(1), pages 29-46, August.
    17. Yiwei Chen & Nikolaos Trichakis, 2021. "Technical Note—On Revenue Management with Strategic Customers Choosing When and What to Buy," Operations Research, INFORMS, vol. 69(1), pages 175-187, January.
    18. Ravi Jagannathan & Iwan Meier, 2002. "Do We Need CAPM for Capital Budgeting?," Financial Management, Financial Management Association, vol. 31(4), Winter.
    19. Qi‐Ming He & James H. Bookbinder & Qishu Cai, 2020. "Optimal policies for stochastic clearing systems with time‐dependent delay penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(7), pages 487-502, October.
    20. Kirill Rudov, 2024. "Fragile Stable Matchings," Papers 2403.12183, arXiv.org.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormsom:v:28:y:2026:i:1:p:290-307. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.