Electronic Resource
Springer
Journal of optimization theory and applications
15 (1975), S. 311-325
ISSN:
1573-2878
Keywords:
Dynamic programming
;
optimal strategies
;
optimization theory
;
sequential decision analysis
;
optimal stopping theory
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00933340
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |