A markov chain version of the secretary problem

S. Christian Albright

Naval Research Logistics Quarterly, 1976, vol. 23, issue 1, 151-159

Abstract: This paper deals with the Secretary Problem where n secretaries are interviewed sequentially and the best k must be hired. The values of the secretaries are observed as they are interviewed, but beforehand only the distributions of these values are known. Furthermore, the distributions of two successive secretaries' values are governed by a Markov chain. Optimal hiring policies for finite n and limiting optimal policies as k and n approach infinity are obtained.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/nav.3800230114

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:wly:navlog:v:23:y:1976:i:1:p:151-159

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().