


























A Dynkin game is a zero-sum, stochastic stopping game between two players where either player can stop the game at any time for an observable payoff. Typically the payoff process of the max-player is assumed to be smaller than the payoff process of the min-player, while the payoff process for simultaneous stopping is in between the two. In this paper, we study general Dynkin games whose payoff processes are in arbitrary positions. In both discrete and continuous time settings, we provide necessary and sufficient conditions for the existence of pure strategy Nash equilibria and epsilon-optimal stopping times in all possible subgames.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。