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

Tōru Nakai
Additional contact information
Tōru Nakai: University of Osaka Prefecture, Osaka, Japan

Operations Research, 1986, vol. 34, issue 3, 478-485

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.

Keywords: 97 problem of optimal selection; 111 problem of optimal selection; optimal stopping problem (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.34.3.478 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:34:y:1986:i:3:p:478-485

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().