Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-10T22:14:46.208Z Has data issue: false hasContentIssue false
  • English
  • Français

Duration of a secretary problem

Part of: Combinatorial probability Stochastic processes

Published online by Cambridge University Press:  14 July 2016

Geoffrey F. Yeo
Geoffrey F. Yeo*
Affiliation:
Murdoch University
*
∗Postal address: Department of Mathematics and Statistics, Murdoch University, Murdoch 6150, Australia. yeo@prodigal.murdoch.edu.au
Get access Rights & Permissions [Opens in a new window]

Abstract

The distribution of the number of items drawn in a secretary problem, with an order s selection role and a success if any of the best s items is selected, is obtained by a probabilistic argument. Moments and asymptotics readily follow.

Keywords

COMBINATORICSASYMPTOTICS

MSC classification

Primary: 60C05: Combinatorial probability
Secondary: 60G40: Stopping times; optimal stopping problems; gambling theory
Type
Short Communications
Information
Journal of Applied Probability , Volume 34 , Issue 2 , June 1997 , pp. 556 - 558
Copyright
Copyright © Applied Probability Trust 1997 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Feller, W. (1968) An Introduction to Probability Theory and Its Applications. Wiley, New York.Google Scholar
Frank, A. Q. and Samuels, S. M. (1980) On an optimal stopping problem of Gusein-Zade. Stoch. Proc. Appl. 10, 299–311.CrossRefGoogle Scholar
Freeman, P. R. (1983) The secretary problem and its extension. Int. Statist. Rev. 51, 189–206.Google Scholar
Quine, M. P. and Law, J. S. (1996) Exact results for a secretary problem. J. Appl. Prob. 33, 630–639.Google Scholar
Yeo, A. J. and Yeo, G. F. (1994) Selecting satisfactory secretaries. Aust. J. Statist. 36, 185–198.Google Scholar