IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v72y2024i5p2076-2081.html
   My bibliography  Save this article

Technical Note—On Hiring Secretaries with Stochastic Departures

Author

Listed:
  • Thomas Kesselheim

    (Institute of Computer Science, University of Bonn, 53115 Bonn, Germany)

  • Alexandros Psomas

    (Department of Computer Science, Purdue University, West Lafayette, Indiana 47907)

  • Shai Vardi

    (Krannert School of Management, Purdue University, West Lafayette, Indiana 47906)

Abstract

We study a generalization of the secretary problem, where decisions do not have to be made immediately upon applicants’ arrivals. After arriving, each applicant stays in the system for some (random) amount of time and then leaves, whereupon the algorithm has to decide irrevocably whether to select this applicant or not. The arrival and waiting times are drawn from known distributions, and the decision maker’s goal is to maximize the probability of selecting the best applicant overall. Our first main result is a characterization of the optimal policy for this setting. We show that when deciding whether to select an applicant, it suffices to know only the time and the number of applicants that have arrived so far. Furthermore, the policy is monotone nondecreasing in the number of applicants seen so far, and, under certain natural conditions, monotone nonincreasing in time. Our second main result is that when the number of applicants is large, a single threshold policy is almost optimal. Funding: A. Psomas is supported in part by the National Science Foundation [Grant CCF-2144208], a Google Research Scholar Award, and by the Algorand Centres of Excellence program managed by Algorand Foundation. Supplemental Material: The online appendix is available at https://doi.org/10.1287/opre.2023.2476 .

Suggested Citation

  • 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.
  • Handle: RePEc:inm:oropre:v:72:y:2024:i:5:p:2076-2081
    DOI: 10.1287/opre.2023.2476
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2023.2476
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2023.2476?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
    ---><---

    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:oropre:v:72:y:2024:i:5:p:2076-2081. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.