arXiv Analytics

Sign in

arXiv:1009.3862 [math.PR]AbstractReferencesReviewsResources

Optimal stopping in a general framework

Magdalena Kobylanski, Marie-Claire Quenez

Published 2010-09-20, updated 2013-02-28Version 3

We study the optimal stopping time problem $v(S)={\rm ess}\sup_{\theta \geq S} E[\phi(\theta)|\mathcal {F}_S]$, for any stopping time $S$, where the reward is given by a family $(\phi(\theta),\theta\in\mathcal{T}_0)$ \emph{of non negative random variables} indexed by stopping times. We solve the problem under weak assumptions in terms of integrability and regularity of the reward family. More precisely, we only suppose $v(0) < + \infty$ and $ (\phi(\theta),\theta\in \mathcal{T}_0)$ upper semicontinuous along stopping times in expectation. We show the existence of an optimal stopping time and obtain a characterization of the minimal and the maximal optimal stopping times. We also provide some local properties of the value function family. All the results are written in terms of families of random variables and are proven by only using classical results of the Probability Theory.

Journal: Electronic Journal of Probability 17, 72 (2012) 1-28
DOI: 10.1214
Categories: math.PR
Related articles: Most relevant | Search more
arXiv:1812.04564 [math.PR] (Published 2018-12-11)
Global $C^1$ Regularity of the Value Function in Optimal Stopping Problems
arXiv:1812.08626 [math.PR] (Published 2018-12-20)
Optimal Stopping under G-expectation
arXiv:1205.0925 [math.PR] (Published 2012-05-04)
Controlled stochastic networks in heavy traffic: Convergence of value functions