On multiple stopping bales
- 1 January 1985
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 16 (3) , 401-418
- https://doi.org/10.1080/02331938508843030
Abstract
A multiple (k-)stopping rule with respect to σ-algebras is a sequenee of k stopping times . If measurable and integrable for all , the aim is to find such that is maximized. This yields a new class of stopping problems including the rank selection problems of Platen ([4]). Some general theorems on optimal k-stopping rules are proved and then applied to several examples. E.g. for the case of choosing k out of N independent sequentially appearing random values such that the expected sum is maximal the asymptotic behavior of the “pay-off” is studied in cletaiL Finallv a new rank selection problem is solved.Keywords
This publication has 4 references indexed in Scilit:
- Efficient stopping of a random series of partially ordered pointsPublished by Springer Nature ,1980
- Sequentielle Rangauswahlprobleme ‐ eine Erweiterung des „Secretary Problems”︁ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1977
- Optimal Sequential Procedures when More Than one Stop is RequiredThe Annals of Mathematical Statistics, 1967
- Recognizing the Maximum of a SequenceJournal of the American Statistical Association, 1966