### Abstract

Language | English |
---|---|

Pages | 157-169 |

Journal | Probability in the Engineering and Informational Sciences |

Volume | 25 |

Issue number | 2 |

DOIs | |

State | Published - 2011 |

### Fingerprint

### Cite this

}

*Probability in the Engineering and Informational Sciences*, vol 25, no. 2, pp. 157-169. DOI: 10.1017/S026996481000032X

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

Research output: Contribution to journal › Article

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 -