Related papers: On Zero-sum Optimal Stopping Games
We construct a saddle point in a class of zero-sum games between a stopper and a singular-controller. The underlying dynamics is a one-dimensional, time-homogeneous, singularly controlled diffusion taking values either on $\mathbb{R}$ or on…
We use martingale and stochastic analysis techniques to study a continuous-time optimal stopping problem, in which the decision maker uses a dynamic convex risk measure to evaluate future rewards. We also find a saddle point for an…
We analyze a two-player, nonzero-sum Dynkin game of stopping with incomplete information. We assume that each player observes his own Brownian motion, which is not only independent of the other player's Brownian motion but also not…
In this paper, we study the optimal stopping problem in the case where the reward is given by a family $(\phi(\tau ),\;\;\tau \in \stopo)$ of non negative random variables indexed by predictable stopping times. We treat the problem by means…
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…
This paper investigates value function approximation in the context of zero-sum Markov games, which can be viewed as a generalization of the Markov decision process (MDP) framework to the two-agent case. We generalize error bounds from MDPs…
A new class of multi-player competitive stochastic games in discrete-time with an affine specification of the redistribution of payoffs at exercise is proposed and examined. Our games cover as a very special case the classic two-person…
One of the most classical games for stochastic processes is the zero-sum Dynkin (stopping) game. We present a complete equilibrium solution to a general formulation of this game with an underlying one-dimensional diffusion. A key result is…
Three notions of random stopping times exist in the literature. We introduce two concepts of equivalence of random stopping times, motivated by optimal stopping problems and stopping games respectively. We prove that these two concepts…
We consider two-player non-zero-sum stopping games in discrete time. Unlike Dynkin games, in our games the payoff of each player is revealed after both players stop. Moreover, each player can adjust her own stopping strategy according to…
We consider the optimal double stopping time problem defined for each stopping time $S$ by $v(S)=\esssup\{E[\psi(\tau_1, \tau_2) | \F_S], \tau_1, \tau_2 \geq S \}$. Following the optimal one stopping time problem, we study the existence of…
We study a class of zero-sum games between a singular-controller and a stopper over finite-time horizon. The underlying process is a multi-dimensional (locally non-degenerate) controlled stochastic differential equation (SDE) evolving in an…
The Chow-Robbins game is a classical still partly unsolved stopping problem introduced by Chow and Robbins in 1965. You repeatedly toss a fair coin. After each toss, you decide if you take the fraction of heads up to now as a payoff,…
Given a standard Brownian motion $B^{\mu}=(B_t^{\mu})_{0\le t\le T}$ with drift $\mu \in \mathbb{R}$ and letting $S_t^{\mu}=\max_{0\le s\le t}B_s^{\mu}$ for $0\le t\le T$, we consider the optimal prediction problem: \[V=\inf_{0\le \tau \le…
We study a general formulation of the classical two-player Dynkin game in a discrete time Markovian setting. We identify an appropriate class of mixed strategies -- \textit{Markovian randomized stopping times} -- in which players stop at…
The paper is concerned with a variant of the continuous-time finite state Markov game of control and stopping where both players can affect transition rates, while only one player can choose a stopping time. We use the dynamic programming…
We consider two person zero-sum games where the players control, at discrete times {tn} induced by a partition $\Pi$ of R + , a continuous time Markov state process. We prove that the limit of the values v$\Pi$ exist as the mesh of $\Pi$…
In two-player zero-sum stochastic games, where two competing players make decisions under uncertainty, a pair of optimal strategies is traditionally described by Nash equilibrium and computed under the assumption that the players have…
We consider a class of zero-sum stopper vs. singular-controller games in which the controller can only act on a subset $d_0<d$ of the $d$ coordinates of a controlled diffusion. Due to the constraint on the control directions these games…
In this paper we study optimal stopping problems with respect to distorted expectations of the form \begin{eqnarray*} \mathcal{E}(X)=\int_{-\infty}^{\infty} x\,dG(F_X(x)), \end{eqnarray*} where $F_X$ is the distribution function of $X$ and…