Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-14T05:20:49.839Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimizing a single uncertain selection by recall of observations

Part of: Stochastic processes

Published online by Cambridge University Press:  14 July 2016

Ted Sweet
Ted Sweet*
Affiliation:
University of Miami
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper considers a variation of the classical secretary problem; this variation allows for the interviewer to make an offer to previously interviewed applicants and for the applicant to reject an offer. In this version, the process ends after any offer is made. Two special cases are considered, where the optimal procedure and its probability of success are given for each. Furthermore, the problem is discussed in general and conditions for optimal strategies are given.

Keywords

SECRETARY PROBLEMMARRIAGE PROBLEMRELATIVE RANKS

MSC classification

Secondary: 60G40: Stopping times; optimal stopping problems; gambling theory
Type
Research Papers
Information
Journal of Applied Probability , Volume 31 , Issue 3 , September 1994 , pp. 660 - 672
Copyright
Copyright © Applied Probability Trust 1994 

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

Ferguson, T. S. (1989) Who solved the secretary problem? Statist. Sci. 4, 282–296.Google Scholar
Freeman, P. R. (1983) The secretrary problem and its extensions - a review. Internat. Statist. Rev. 51, 189–206.Google Scholar
Gilbert, J. P. and Mosteller, F. (1966) Recognizing the maximum of a sequence. J. Amer. Statist. Assoc. 61, 35–73.Google Scholar
Petruccelli, J. D. (1981) Best-choice problems involving uncertainty of selection and recall of observation. J. Appl. Prob. 18, 415–425.Google Scholar
Smith, M. H. (1975) A secretary problem with uncertain employment. J. Appl. Prob. 12, 620–624.CrossRefGoogle Scholar
Yang, M. C. K. (1974) Recognizing the maximum of a sequence with backward solicitation. J. Appl. Prob, 11, 504–512.Google Scholar