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

An Optimal Selection Problem for a Sequence with a Random Number of Applicants Per Period

Author

Listed:
  • Tōru Nakai

    (University of Osaka Prefecture, Osaka, Japan)

Abstract

In the classical secretary problem, an employer interviews and rates applicants one at a time, and wants to stop at an optimal applicant. Such optimal stopping problems also arise in the selection of projects, military targets, and resource alternatives. We consider a generalization of this optimal stopping problem in which the employer wishes to hire a certain number of applicants, the total number of applicants is known, and the number of applicants per day is random. We also treat a variation in which a random number of applicants arrive randomly over time. We derive several properties of the optimal policy and the total expected reward obtainable from this policy. For an optimal policy, in order for an applicant to be selected by the decision maker, the applicant's value must be large in absolute magnitude and be high from among all the applicants.

Suggested Citation

  • Tōru Nakai, 1986. "An Optimal Selection Problem for a Sequence with a Random Number of Applicants Per Period," Operations Research, INFORMS, vol. 34(3), pages 478-485, June.
    • Handle: RePEc:inm:oropre:v:34:y:1986:i:3:p:478-485
    DOI: 10.1287/opre.34.3.478
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.34.3.478
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.34.3.478?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Y H Chun, 2004. "Generalized best choice problem based on the information economics approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 988-999, September.
    2. Chun, Young H., 1999. "Selecting the best choice in the full information group interview problem," European Journal of Operational Research, Elsevier, vol. 119(3), pages 635-651, December.
    3. Ben Abdelaziz, F. & Krichen, S., 2005. "An interactive method for the optimal selection problem with two decision makers," European Journal of Operational Research, Elsevier, vol. 162(3), pages 602-609, May.

    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:34:y:1986:i:3:p:478-485. 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.