Related papers: Dynkin Games for L\'evy Processes
This article treats long term average impulse control problems with running costs in the case that the underlying process is a L\'evy process. Under quite general conditions we characterize the value of the control problem as the value of a…
In this paper we derive a technique of obtaining limit theorems for suprema of L\'evy processes from their random walk counterparts. For each $a>0$, let $\{Y^{(a)}_n:n\ge 1\}$ be a sequence of independent and identically distributed random…
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 start briefly surveying research on optimal stopping games since their introduction by E.B.Dynkin more than 40 years ago. Recent renewed interest to dynkin's games is due, in particular, to the study of Israeli (game) options introduced…
Consider the optimal stopping problem of a one-dimensional diffusion with positive discount. Based on Dynkin's characterization of the value as the minimal excessive majorant of the reward and considering its Riesz representation, we give…
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…
In this paper we consider stochastic optimization problems for an ambiguity averse decision maker who is uncertain about the parameters of the underlying process. In a first part we consider problems of optimal stopping under drift…
In this paper we study the convergence of solutions for (possibly degenerate) stochastic differential equations driven by L\'evy processes, when the coefficients converge in some appropriate sense. First, we prove, by means of a…
Simple stochastic games can be solved by value iteration (VI), which yields a sequence of under-approximations of the value of the game. This sequence is guaranteed to converge to the value only in the limit. Since no stopping criterion is…
We develop the fictitious play algorithm in the context of the linear programming approach for mean field games of optimal stopping and mean field games with regular control and absorption. This algorithm allows to approximate the mean…
This paper studies a nonzero-sum Dynkin game in discrete time under non-exponential discounting. For both players, there are two levels of game-theoretic reasoning intertwined. First, each player looks for an intra-personal equilibrium…
Verification theorems are key results to successfully employ the dynamic programming approach to optimal control problems. In this paper we introduce a new method to prove verification theorems for infinite dimensional stochastic optimal…
This paper provides necessary and sufficient conditions for a pair of randomised stopping times to form a saddle point of a zero-sum Dynkin game with partial and/or asymmetric information across players. The framework is non-Markovian and…
We study a Stackelberg variant of the classical discrete-time Dynkin game, in which Player 1 (the leader) commits to a stopping strategy first and Player 2 (the follower) responds optimally. This leader-follower structure induces an optimal…
We study a class of deterministic mean field games on finite and infinite time horizons arising in models of optimal exploitation of exhaustible resources. The main characteristic of our game is an absorption constraint on the players'…
Several long-time limit theorems of one-dimensional L\'evy processes weighted and normalized by functions of its supremum are studied. The long-time limits are taken via the families of exponential times and that of constant times, called…
In the nonzero-sum setting, we establish a connection between Nash equilibria in games of optimal stopping (Dynkin games) and generalised Nash equilibrium problems (GNEP). In the Dynkin game this reveals novel equilibria of threshold type…
For two-person dynamic zero-sum games (both discrete and continuous settings), we investigate the limit of value functions of finite horizon games with long run average cost as the time horizon tends to infinity and the limit of value…
We consider multi-player stopping games in continuous time. Unlike Dynkin games, in our games the payoff of each player is revealed after all the players stop. Moreover, each player can adjust her own stopping strategy by observing other…
We study zero-sum games in the space of probability distributions over the Euclidean space $\mathbb{R}^d$ with entropy regularization, in the setting when the interaction function between the players is smooth and strongly convex-strongly…