Optimal multiple stopping time problem

We study the optimal multiple stopping time problem defined for each stopping time S by v(S)=esssup.1,.,.d.SE[.(.1,.,.d)|FS] . The key point is the construction of a new reward . such that the value function v(S) also satisfies v(S)=esssup..SE[.(.)|FS] . This new reward . 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 ., we show that the new reward . can be aggregated by a progressive process. This leads to new applications, particularly in finance (applications to American options with multiple exercise times).