Table of Contents
Fetching ...

Optimal Stopping Under Model Uncertainty in a General Setting

Ihsan Arharas, Siham Bouhadou, Astrid Hilbert, Youssef Ouknine

Abstract

We consider the optimal stopping time problem under model uncertainty $R(v)= {\text{ess}\sup\limits}_{ \mathbb{P} \in \mathcal{P}} {\text{ess}\sup\limits}_{τ\in \mathcal{S}_v} E^\mathbb{P}[Y(τ) \vert \mathcal{F}_v]$, for every stopping time $v$, set in the framework of families of random variables indexed by stopping times. This setting is more general than the classical setup of stochastic processes, and particularly allows for general payoff processes that are not necessarily right-continuous. Under weaker integrability, and regularity assumptions on the reward family $Y=(Y(v), v\in \mathcal{S})$, we show the existence of an optimal stopping time. We then proceed to find sufficient conditions for the existence of an optimal model. For this purpose, we present a universal Doob-Meyer-Mertens's decomposition for the Snell envelope family associated with $Y$ in the sense that it holds simultaneously for all $\mathbb{P} \in \mathcal{P}$. This decomposition is then employed to prove the existence of an optimal probability model and study its properties.

Optimal Stopping Under Model Uncertainty in a General Setting

Abstract

We consider the optimal stopping time problem under model uncertainty , for every stopping time , set in the framework of families of random variables indexed by stopping times. This setting is more general than the classical setup of stochastic processes, and particularly allows for general payoff processes that are not necessarily right-continuous. Under weaker integrability, and regularity assumptions on the reward family , we show the existence of an optimal stopping time. We then proceed to find sufficient conditions for the existence of an optimal model. For this purpose, we present a universal Doob-Meyer-Mertens's decomposition for the Snell envelope family associated with in the sense that it holds simultaneously for all . This decomposition is then employed to prove the existence of an optimal probability model and study its properties.
Paper Structure (5 sections, 14 theorems, 103 equations)

This paper contains 5 sections, 14 theorems, 103 equations.

Key Result

Proposition 3.1

(Admissibility of $v$ and $v^+$) The families $R= (R(v), v\in \mathcal{S})$ and $R^+= (R^+(v), v\in \mathcal{S})$ defined by R and R^+ are admissible.

Theorems & Definitions (37)

  • Definition 2.1
  • Definition 3.1
  • Remark 3.1
  • Proposition 3.1
  • proof
  • Proposition 3.2
  • proof
  • Definition 3.2
  • Proposition 3.3
  • proof
  • ...and 27 more