Approximate results for a generalized secretary problem

Research output: Contribution to journalArticle

Abstract

A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b ≥1 is a preassigned number. It is known, already for a long time, that for the optimal policy, one needs to compute b position thresholds (for instance, via backward induction). In this article we study approximate policies that use just a single or a double position threshold, albeit in conjunction with a level rank. We give exact and asymptotic (as n → ∞) results, which show that the double-level policy is an extremely accurate approximation. © 2011 Cambridge University Press.
LanguageEnglish
Pages157-169
JournalProbability in the Engineering and Informational Sciences
Volume25
Issue number2
DOIs
StatePublished - 2011

Cite this

@article{9b5e64b2a4114445985274d3a5e22ce4,
title = "Approximate results for a generalized secretary problem",
abstract = "A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b ≥1 is a preassigned number. It is known, already for a long time, that for the optimal policy, one needs to compute b position thresholds (for instance, via backward induction). In this article we study approximate policies that use just a single or a double position threshold, albeit in conjunction with a level rank. We give exact and asymptotic (as n → ∞) results, which show that the double-level policy is an extremely accurate approximation. \{circledC} 2011 Cambridge University Press.",
author = "C. Dietz and {van der Laan}, D.A. and A.A.N. Ridder",
year = "2011",
doi = "10.1017/S026996481000032X",
language = "English",
volume = "25",
pages = "157--169",
journal = "Probability in the Engineering and Informational Sciences",
issn = "0269-9648",
publisher = "Cambridge University Press",
number = "2",

}

Approximate results for a generalized secretary problem. / Dietz, C.; van der Laan, D.A.; Ridder, A.A.N.

In: Probability in the Engineering and Informational Sciences, Vol. 25, No. 2, 2011, p. 157-169.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Approximate results for a generalized secretary problem

AU - Dietz,C.

AU - van der Laan,D.A.

AU - Ridder,A.A.N.

PY - 2011

Y1 - 2011

N2 - A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b ≥1 is a preassigned number. It is known, already for a long time, that for the optimal policy, one needs to compute b position thresholds (for instance, via backward induction). In this article we study approximate policies that use just a single or a double position threshold, albeit in conjunction with a level rank. We give exact and asymptotic (as n → ∞) results, which show that the double-level policy is an extremely accurate approximation. © 2011 Cambridge University Press.

AB - A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b ≥1 is a preassigned number. It is known, already for a long time, that for the optimal policy, one needs to compute b position thresholds (for instance, via backward induction). In this article we study approximate policies that use just a single or a double position threshold, albeit in conjunction with a level rank. We give exact and asymptotic (as n → ∞) results, which show that the double-level policy is an extremely accurate approximation. © 2011 Cambridge University Press.

U2 - 10.1017/S026996481000032X

DO - 10.1017/S026996481000032X

M3 - Article

VL - 25

SP - 157

EP - 169

JO - Probability in the Engineering and Informational Sciences

T2 - Probability in the Engineering and Informational Sciences

JF - Probability in the Engineering and Informational Sciences

SN - 0269-9648

IS - 2

ER -