The Secretary Problem with Optimal Assignment

Mitsushi Tamaki
Additional contact information
Mitsushi Tamaki: Otemon-Gakuin University, Osaka, Japan

Operations Research, 1984, vol. 32, issue 4, 847-858

Abstract: We consider the secretary problem with assignment of the applicants to m positions to be staffed in order to maximize the probability that we select only the m best, and assign the k th best to the k th position. A simple strategy is proposed. Although the optimal strategies for m = 1, 2 are known to be simple, we show that the optimal strategy for m = 3 is not necessarily simple. However, a simple strategy turns out to be a fairly good suboptimal strategy.

Keywords: 111 secretary problem; sequential assignment; 751 secretary problem (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.32.4.847 (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:32:y:1984:i:4:p:847-858

Access Statistics for this article

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