2000 character limit reached
Non-zero-sum stopping games in continuous time (1508.03921v1)
Published 17 Aug 2015 in math.OC
Abstract: 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 $ui := \mathbb{E}[Ui(\rho,\tau)],\ i=1,2$, where the first player choose a stopping strategy $\rho$ to maximize $u1$ and the second player chose a stopping strategy $\tau$ to maximize $u2$. Unlike the Dynkin game, here we assume that $U(s,t)$ is $\mathcal{F}_{s\vee t}$-measurable. Assuming the continuity of $Ui$ in $(s,t)$, we show that there exists an $\epsilon$-Nash equilibrium for any $\epsilon>0$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.