Optimal multiple stopping time problem - Université Claude Bernard Lyon 1 Accéder directement au contenu
Article Dans Une Revue The Annals of Applied Probability Année : 2011

Optimal multiple stopping time problem

Résumé

We study the optimal multiple stopping time problem defined for each stopping time S by v(S) = ess sup(tau 1), ... , (tau d) (>=) (S) E[psi(tau(1), ... , tau(d))vertical bar F-S]. The key point is the construction of a new reward phi such that the value function v(S) also satisfies v(S) = ess sup(theta >= S) E[phi(theta)vertical bar F-S]. This new reward phi is not a right-continuous adapted process as in the classical case, but a family of random variables. For such a reward, we prove a new existence result for optimal stopping times under weaker assumptions than in the classical case. This result is used to prove the existence of optimal multiple stopping times for v(S) by a constructive method. Moreover, under strong regularity assumptions on psi, we show that the new reward phi can be aggregated by a progressive process. This leads to new applications, particularly in finance (applications to American options with multiple exercise times).

Dates et versions

hal-00633327 , version 1 (18-10-2011)

Identifiants

Citer

M.-C. Quenez, M. Kobylanski, E. Rouy-Mironescu. Optimal multiple stopping time problem. The Annals of Applied Probability, 2011, 21 (4), pp.1365-1399. ⟨10.1214/10-AAP727⟩. ⟨hal-00633327⟩
373 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More