Related papers: On Zero-sum Optimal Stopping Games
Two concepts of random stopping times in continuous time have been defined in the literature, mixed stopping times and randomized stopping times. We show that under weak conditions these two concepts are equivalent, and, in fact, that all…
We present two zero-sum games modeling situations where one player attacks (or hides in) a finite dimensional nonempty compact set, and the other tries to prevent the attack (or find him). The first game, called patrolling game, corresponds…
Given a standard Brownian motion $B^{\mu}=(B_t^{\mu})_{0\le t\le T}$ with drift $\mu \in IR$ and letting $g$ denote the last zero of $B^{\mu}$ before $T$, we consider the optimal prediction problem V_*=\inf_{0\le \tau \le T}\mathsf…
Robbins' problem of optimal stopping asks one to minimise the expected {\it rank} of observation chosen by some nonanticipating stopping rule. We settle a conjecture regarding the {\it value} of the stopped variable under the rule optimal…
This paper is interested in the problem of optimal stopping in a mean field game context. The notion of mixed solution is introduced to solve the system of partial differential equations which models this kind of problem. This notion…
We prove that every two-player nonzero-sum stopping game in discrete time admits an \epsilon-equilibrium in randomized strategies for every \epsilon >0. We use a stochastic variation of Ramsey's theorem, which enables us to reduce the…
A game-theoretic framework for time-inconsistent stopping problems where the time-inconsistency is due to the consideration of a non-linear function of an expected reward is developed. A class of mixed strategy stopping times that allows…
We study zero-sum stochastic games for controlled discrete time Markov chains with risk-sensitive average cost criterion with countable state space and Borel action spaces. The payoff function is nonnegative and possibly unbounded. Under a…
We address an optimal stopping problem over the set of Bermudan-type strategies $\Theta$ (which we understand in a more general sense than the stopping strategies for Bermudan options in finance) and with non-linear operators (non-linear…
The paper proposes a natural measure space of zero-sum perfect information games with upper semicontinuous payoffs. Each game is specified by the game tree, and by the assignment of the active player and of the capacity to each node of the…
Nonzero-sum stochastic differential games with impulse controls offer a realistic and far-reaching modelling framework for applications within finance, energy markets, and other areas, but the difficulty in solving such problems has…
We consider the optimal stopping time problem under model uncertainty $R(v)= {\text{ess}\sup\limits}_{ \mathbb{P} \in \mathcal{P}} {\text{ess}\sup\limits}_{\tau \in \mathcal{S}_v} E^\mathbb{P}[Y(\tau) \vert \mathcal{F}_v]$, for every…
Given a stochastic state process $(X_t)_t$ and a real-valued submartingale cost process $(S_t)_t$, we characterize optimal stopping times $\tau$ that minimize the expectation of $S_\tau$ while realizing given initial and target…
In this paper we present a new verification theorem for optimal stopping problems for Hunt processes. The approach is based on the Fukushima-Dynkin formula, and its advantage is that it allows us to verify that a given function is the value…
The paper deals with a zero-sum differential game in which the dynamical system is described by a fractional differential equation with the Caputo derivative of an order $\alpha \in (0, 1).$ The goal of the first (second) player is to…
This paper deals with the optimal stopping problem under partial observation for piecewise-deterministic Markov processes. We first obtain a recursive formulation of the optimal filter process and derive the dynamic programming equation of…
We suggest a new algorithm for two-person zero-sum undiscounted stochastic games focusing on stationary strategies. Given a positive real $\epsilon$, let us call a stochastic game $\epsilon$-ergodic, if its values from any two initial…
The \emph{$ p$-processor cup game} is a classic and widely studied scheduling problem that captures the setting in which a $p$-processor machine must assign tasks to processors over time in order to ensure that no individual task ever falls…
In this paper, we investigate dynamic optimization problems featuring both stochastic control and optimal stopping in a finite time horizon. The paper aims to develop new methodologies, which are significantly different from those of mixed…
We formulate a notion of doubly reflected BSDE in the case where the barriers $\xi$ and $\zeta$ do not satisfy any regularity assumption and with a general filtration. Under a technical assumption (a Mokobodzki-type condition), we show…