A verification theorem for optimal stopping problems with expectation constraints - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2015

A verification theorem for optimal stopping problems with expectation constraints

Résumé

We consider the problem of optimally stopping a continuous-time process with a stopping time satisfying a given expectation cost constraint. We show, by introducing a new state variable, that one can transform the problem into an unconstrained control problem and hence derive a dynamic programming principle. We characterize the value function in terms of the dynamic programming equation, which turns out to be an elliptic, fully non-linear partial differential equation of second order. We prove a classical verification theorem and illustrate its applicability with several examples.
Fichier principal
Vignette du fichier
DDP_WeakTimeHorizon15.pdf (1.48 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01229024 , version 1 (16-11-2015)

Identifiants

  • HAL Id : hal-01229024 , version 1

Citer

Stefan Ankirchner, Maike Klein, Thomas Kruse. A verification theorem for optimal stopping problems with expectation constraints. 2015. ⟨hal-01229024⟩
476 Consultations
762 Téléchargements

Partager

Gmail Facebook X LinkedIn More