arXiv Analytics

Sign in

arXiv:1508.03921 [math.OC]AbstractReferencesReviewsResources

Non-zero-sum stopping games in continuous time

Zhou Zhou

Published 2015-08-17Version 1

On a filtered probability space $(\Omega ,\mathcal{F}, (\mathcal{F}_t)_{t\in[0,\infty]}, \mathbb{P})$, we consider the two-player non-zero-sum stopping game $u^i := \mathbb{E}[U^i(\rho,\tau)],\ i=1,2$, where the first player choose a stopping strategy $\rho$ to maximize $u^1$ and the second player chose a stopping strategy $\tau$ to maximize $u^2$. Unlike the Dynkin game, here we assume that $U(s,t)$ is $\mathcal{F}_{s\vee t}$-measurable. Assuming the continuity of $U^i$ in $(s,t)$, we show that there exists an $\epsilon$-Nash equilibrium for any $\epsilon>0$.

Related articles: Most relevant | Search more
arXiv:math/0306279 [math.OC] (Published 2003-06-19)
Stopping games in continuous time
arXiv:1509.03950 [math.OC] (Published 2015-09-14)
Multi-player stopping games in continuous time
arXiv:0810.5148 [math.OC] (Published 2008-10-28)
Scheduling Kalman Filters in Continuous Time