The Annals of Applied Probability
- Ann. Appl. Probab.
- Volume 21, Number 5 (2011), 1965-1993.
On approximative solutions of multistopping problems
In this paper, we consider multistopping problems for finite discrete time sequences X1, …, Xn. m-stops are allowed and the aim is to maximize the expected value of the best of these m stops. The random variables are neither assumed to be independent not to be identically distributed. The basic assumption is convergence of a related imbedded point process to a continuous time Poisson process in the plane, which serves as a limiting model for the stopping problem. The optimal m-stopping curves for this limiting model are determined by differential equations of first order. A general approximation result is established which ensures convergence of the finite discrete time m-stopping problem to that in the limit model. This allows the construction of approximative solutions of the discrete time m-stopping problem. In detail, the case of i.i.d. sequences with discount and observation costs is discussed and explicit results are obtained.
Ann. Appl. Probab., Volume 21, Number 5 (2011), 1965-1993.
First available in Project Euclid: 25 October 2011
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Faller, Andreas; Rüschendorf, Ludger. On approximative solutions of multistopping problems. Ann. Appl. Probab. 21 (2011), no. 5, 1965--1993. doi:10.1214/10-AAP747. https://projecteuclid.org/euclid.aoap/1319576614