Related papers: On Zero-sum Optimal Stopping Games

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…

We consider a zero-sum continuous time stopping game in which the pay-off is revealed in the maximum of the two stopping times instead of the minimum, which is the case in Dynkin games.

We study the existence of optimal actions in a zero-sum game $\inf_{\tau}\sup_PE^P[X_{\tau}]$ between a stopper and a controller choosing a probability measure. This includes the optimal stopping problem $\inf_{\tau}\mathcal{E}(X_{\tau})$…

The properties of value functions of time inhomogeneous optimal stopping problem and zero-sum game (Dynkin game) are studied through time dependent Dirichlet form. Under the absolute continuity condition on the transition function of the…

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…

We first study an optimal stopping problem in which a player (an agent) uses a discrete stopping time in order to stop optimally a payoff process whose risk is evaluated by a (non-linear) $g$-expectation. We then consider a non-zero-sum…

We study zero-sum stochastic games between a singular controller and a stopper when the (state-dependent) diffusion matrix of the underlying controlled diffusion process is degenerate. In particular, we show the existence of a value for the…

We study a robust optimal stopping problem with respect to a set $\cP$ of mutually singular probabilities. This can be interpreted as a zero-sum controller-stopper game in which the stopper is trying to maximize its pay-off while an adverse…

In this paper, we propose a new efficient algorithm to compute the value function for zero-sum stopping games featuring two players with opposing interests. This can be seen as a game version of the ''forward algorithm'' for (one-player)…

In optimal stopping problems, a Markov structure guarantees Markovian optimal stopping times (first exit times). Surprisingly, there is no analogous result for Markovian stopping games once randomization is required. This paper addresses…

We study two-player zero-sum stopping games in continuous time and infinite horizon. We prove that the value in randomized stopping times exists as soon as the payoff processes are right-continuous. In particular, as opposed to existing…

This paper uses recent results on continuous-time finite-horizon optimal switching problems with negative switching costs to prove the existence of a saddle point in an optimal stopping (Dynkin) game. Sufficient conditions for the game's…

We prove that zero-sum Dynkin games in continuous time with partial and asymmetric information admit a value in randomised stopping times when the stopping payoffs of the players are general \cadlag measurable processes. As a by-product of…

We study the optimal stopping problem of maximizing the variance of an unkilled linear diffusion. Especially, we demonstrate how the problem can be solved as a convex two-player zero-sum game, and reveal quite surprising application of game…

We study the optimal stopping time problem $v(S)={\rm ess}\sup_{\theta \geq S} E[\phi(\theta)|\mathcal {F}_S]$, for any stopping time $S$, where the reward is given by a family $(\phi(\theta),\theta\in\mathcal{T}_0)$ \emph{of non negative…

This paper considers a pair $(\mathbb{F},\tau)$, where $\mathbb{F}$ is a filtration representing the "public" flow of information which is available to all agents overtime, and $\tau$ is a random time which might not be an…

We propose an implementable, neural network-based structure preserving probabilistic numerical approximation for a generalized obstacle problem describing the value of a zero-sum differential game of optimal stopping with asymmetric…

We consider Dynkin games for Markov processes associated with semi-Dirichlet forms. Dynkin games are the optimal stopping games introduced as the models of zero-sum games by two players. We prove that the solution to the certain variational…

This paper studies a 2-players zero-sum Dynkin game arising from pricing an option on an asset whose rate of return is unknown to both players. Using filtering techniques we first reduce the problem to a zero-sum Dynkin game on a…

In this paper we study the nonzero-sum Dynkin game in continuous time which is a two player non-cooperative game on stopping times. We show that it has a Nash equilibrium point for general stochastic processes. As an application, we…