On multiple stopping bales (Q3687443)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3911412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On multiple stopping bales |
scientific article; zbMATH DE number 3911412 |
Statements
On multiple stopping bales (English)
0 references
1985
0 references
multiple optimal stopping rule
0 references
secretary problem
0 references
asymptotic behaviour of the optimal payoff
0 references
0.8719245195388794
0 references
0.8535389304161072
0 references
Consider the problem of finding a multiple optimal stopping rule; that is, instead of selecting a single item in a sequence, as in the classical secretary problem, select k items in such a way as to maximize an arbitrary function of the k items selected. The analysis of this general problem is similar to that presented in ''Great expectations: The theory of optimal stopping ''(1971; Zbl 0233.60044) by \textit{Y. S. Chow}, \textit{H. Robbins} and \textit{D. Siegmund} for the single selection problem. As a particular case, the problem of selecting k out of N sequentially appearing observations with the objective of maximizing their expected sum is considered with or without observation costs, and with or without a discount factor. For this example, the asymptotic behaviour of the optimal payoff is studied in detail. Finally, a new 'secretary problem' is considered, where the objective is to choose three secretaries in such a way as to maximize the probability of selecting the two best ones.
0 references