Abstract
This paper deals with a generalization of a class of optimal stopping problems often referred to as the secretary problem. In the secretary problem, a decision maker views a group ofN candidates sequentially, each of which can be ranked according to some quality, although he does not know any distribution for the quality being measured. Generalizations pursued in this paper include randomN and a more elaborate payoff structure. Conditions on the payoff structure are given which result in a special subclass of stopping rules.
Similar content being viewed by others
References
Gilbert, J., andMosteller, F.,Recognizing the Maximum of a Sequence, American Statistical Association, Vol. 61, No. 313, 1966.
Fox, J. H., andMarnie, L. G., Martin Gardner's column onMathematical Games, Scientific American, Vol. 202, No. 2, 1960.
Moser, L., andPounder, J. R., Martin Gardner's column onMathematical Games, Scientific American, Vol. 202, No. 3, 1960.
Bissinger, B. H., andSiegel, C.,Problem 5086, Advanced Problems and Solutions, American Mathematical Monthly, Vol. 70, No. 3, 1963.
Bosch, A. J.,Solution to Problem 5086: Optimum Strategy in a Guessing Game, Advanced Problems and Solutions, American Mathematical Monthly, Vol. 71, No. 3, 1964.
Dynkin, E. B., andYushkevich, A. A.,Markov Processes, Theorems and Problems, Plenum Publishing Corporation, New York, New York, 1969.
Chow, Y. S., Robbins, H., andSiegmund, D.,Great Expectations: The Theory of Optimal Stopping, Houghton Mifflin Company, Boston, Massachusetts, 1971.
Guesin-Zade, S. M.,The Problem of Choice and the Optimal Stopping Rule for a Sequence of Independent Trials, Theory of Probability and Its Applications, Vol. 11, No. 3, 1966.
Author information
Authors and Affiliations
Additional information
Communicated by A. V. Balakrishnan
Rights and permissions
About this article
Cite this article
Rasmussen, W.T. A generalized choice problem. J Optim Theory Appl 15, 311–325 (1975). https://doi.org/10.1007/BF00933340
Issue Date:
DOI: https://doi.org/10.1007/BF00933340