Papers
Topics
Authors
Recent
Search
2000 character limit reached

Non-zero-sum stopping games in continuous time

Published 17 Aug 2015 in math.OC | (1508.03921v1)

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$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.