arXiv Analytics

Sign in

arXiv:1409.6773 [math.PR]AbstractReferencesReviewsResources

On a Stopping Game in continuous time

Erhan Bayraktar, Zhou Zhou

Published 2014-09-23Version 1

On a filtered probability space $(\Omega,\mathcal{F},P,\mathbb{F}=(\mathcal{F}_t)_{0\leq t\leq T})$, we consider stopper-stopper games $\bar C:=\inf_{\Rho}\sup_{\tau\in\T}\E[U(\Rho(\tau),\tau)]$ and $\underline C:=\sup_{\Tau}\inf_{\rho\in\T}\E[U(\Rho(\tau),\tau)]$ in continuous time, where $U(s,t)$ is $\mathcal{F}_{s\vee t}$-measurable (this is the new feature of our stopping game), $\T$ is the set of stopping times, and $\Rho,\Tau:\T\mapsto\T$ satisfy certain non-anticipativity conditions. We show that $\bar C=\underline C$, by converting these problems into a corresponding Dynkin game.

Comments: Keywords: A new type of optimal stopping game, non-anticipative stopping strategies, Dynkin games, saddle point
Categories: math.PR, math.OC, q-fin.MF
Subjects: 60G40, 93E20, 91A10, 91A60, 60G07
Related articles: Most relevant | Search more
arXiv:1403.7886 [math.PR] (Published 2014-03-31)
Equivalence between Random Stopping Times in Continuous Time
arXiv:1611.05545 [math.PR] (Published 2016-11-17)
Stochastic Gradient Descent in Continuous Time
arXiv:math/0505241 [math.PR] (Published 2005-05-12)
On the convergence from discrete to continuous time in an optimal stopping problem