Translator Disclaimer
August, 1977 The Finite-Memory Secretary Problem
H. Rubin, S. M. Samuels
Ann. Probab. 5(4): 627-635 (August, 1977). DOI: 10.1214/aop/1176995774

Abstract

The expected rank of the individual selected in the secretary problem can be kept bounded as the number of individuals becomes infinite even if we are not permitted to remember more than one individual at a time. The least upper bound of these expected ranks is derived: it is approximately 7.4.

Citation

Download Citation

H. Rubin. S. M. Samuels. "The Finite-Memory Secretary Problem." Ann. Probab. 5 (4) 627 - 635, August, 1977. https://doi.org/10.1214/aop/1176995774

Information

Published: August, 1977
First available in Project Euclid: 19 April 2007

zbMATH: 0381.60036
MathSciNet: MR517901
Digital Object Identifier: 10.1214/aop/1176995774

Subjects:
Primary: 60G40

Rights: Copyright © 1977 Institute of Mathematical Statistics

JOURNAL ARTICLE
9 PAGES


SHARE
Vol.5 • No. 4 • August, 1977
Back to Top