A general result on the method of randomized stopping is proved. It is applied to optimal stopping of controlled diffusion processes with unbounded coefficients to reduce it to an optimal control problem without stopping. This is motivated by recent results of Krylov on numerical solutions to the Bellman equation.
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 literature, we do not assume any conditions on the relations between the payoff processes. We also show that both players have simple epsilon- optimal randomized stopping times; namely, randomized stopping times which are small perturbations of non-randomized stopping times.
In this work we consider optimal stopping problems with conditional convex risk measures called optimised certainty equivalents. Without assuming any kind of time-consistency for the underlying family of risk measures, we derive a novel representation for the solution of the optimal stopping problem. In particular, we generalise the additive dual representation of Rogers (2002) to the case of optimal stopping under uncertainty. Finally, we develop several Monte Carlo algorithms and illustrate their power for optimal stopping under Average Value at Risk.
In this article we study and classify optimal martingales in the dual formulation of optimal stopping problems. In this respect we distinguish between weakly optimal and surely optimal martingales. It is shown that the family of weakly optimal and surely optimal martingales may be quite large. On the other hand it is shown that the Doob-martingale, that is, the martingale part of the Snell envelope, is in a certain sense the most robust surely optimal martingale under random perturbations. This new insight leads to a novel randomized dual martingale minimization algorithm that doesn't require …
In a classical optimal stopping problem the aim is to maximize the expected value of a functional of a diffusion evaluated at a stopping time. This note considers optimal stopping problems beyond this paradigm. We study problems in which the value associated to a stopping rule depends on the law of the stopped process. If this value is quasi-convex on the space of attainable laws then it is a well known result that it is sufficient to restrict attention to the class of threshold strategies. However, if the objective function is not quasi-convex, this may not be the case. We show that, nonethel…
We prove that every two-player non-zero-sum Dynkin game in continuous time admits an epsilon-equilibrium in randomized stopping times. We provide a condition that ensures the existence of an epsilon-equilibrium in non-randomized stopping times.
In this paper, we will study the behavior of the space of positive harmonic functions associated with the random walk on a discrete group under the change of probability measure by a randomized stopping time. We show that this space remains unchanged after applying a bounded randomized stopping time.
Given an initial (resp., terminal) probability measure $μ$ (resp., $ν$) on $\mathbb{R}^d$, we characterize those optimal stopping times $τ$ that maximize or minimize the functional $\mathbb{E} |B_0 - B_τ|^α$, $α> 0$, where $(B_t)_t$ is Brownian motion with initial law $B_0\sim μ$ and with final distribution --once stopped at $τ$-- equal to $B_τ\sim ν$. The existence of such stopping times is guaranteed by Skorohod-type embeddings of probability measures in "subharmoic order" into Brownian motion. This problem is equivalent to an optimal mass transport problem with certain constraints, namely t…
It is proved that the law of a possibly killed Lévy process $X$, seen up to and including (resp. up to strictly before) a stopping time, determines already the law of $X$ (resp. up to a compound Poisson component and killing).
This paper attempts to study the optimal stopping time for semi-Markov processes (SMPs) under the discount optimization criteria with unbounded cost rates. In our work, we introduce an explicit construction of the equivalent semi-Markov decision processes (SMDPs). The equivalence is embodied in the value functions of SMPs and SMDPs, that is, every stopping time of SMPs can induce a policy of SMDPs such that the value functions are equal, and vice versa. The existence of the optimal stopping time of SMPs is proved by this equivalence relation. Next, we give the optimality equation of the value …
We study the optimal stopping problem of McKean-Vlasov diffusions when the criterion is a function of the law of the stopped process. A remarkable new feature in this setting is that the stopping time also impacts the dynamics of the stopped process through the dependence of the coefficients on the law. The mean field stopping problem is introduced in weak formulation in terms of the joint marginal law of the stopped underlying process and the survival process. This specification satisfies a dynamic programming principle. The corresponding dynamic programming equation is an obstacle problem on…
We study the problem of stopping a Brownian motion at a given distribution $ν$ while optimizing a reward function that depends on the (possibly randomized) stopping time and the Brownian motion. Our first result establishes that the set $\mathcal{T}(ν)$ of stopping times embedding $ν$ is weakly dense in the set $\mathcal{R}(ν)$ of randomized embeddings. In particular, the optimal Skorokhod embedding problem over $\mathcal{T}(ν)$ has the same value as the relaxed one over $\mathcal{R}(ν)$ when the reward function is semicontinuous, which parallels a fundamental result about Monge maps and Kanto…
We study a class of optimal stopping games (Dynkin games) of preemption type, with uncertainty about the existence of competitors. The set-up is well-suited to model, for example, real options in the context of investors who do not want to publicly reveal their interest in a certain business opportunity. We show that there exists a Nash equilibrium in randomized stopping times which is described explicitly in terms of the corresponding one-player game.
We propose a new method for solving optimal stopping problems (such as American option pricing in finance) under minimal assumptions on the underlying stochastic process $X$. We consider classic and randomized stopping times represented by linear and non-linear functionals of the rough path signature $\mathbb{X}^{<\infty}$ associated to $X$, and prove that maximizing over these classes of signature stopping times, in fact, solves the original optimal stopping problem. Using the algebraic properties of the signature, we can then recast the problem as a (deterministic) optimization problem depen…
Convergence is proved for solutions of Dirichlet problems in regions with many small excluded sets (holes), as the holes become smaller and more numerous. The problem is formulated in the context of Markov processes associated with general Dirichlet forms, for random and nonrandom excluded sets. Sufficient conditions are given under which the sequence of entrance times or hitting times of the excluded sets converges in the stable topology. Convergence in the stable topology is a strengthened form of convergence in distribution, introduced by Renyi. Stable convergence of the entrance times impl…
Let X_t, 0<=t<=T be a one-dimensional stochastic process with independent and stationary increments. This paper considers the problem of stopping the process X_t "as close as possible" to its eventual supremum M_T:=sup{X_t: 0<=t<=T}, when the reward for stopping with a stopping time tau<=T is a nonincreasing convex function of M_T-X_tau. Under fairly general conditions on the process X_t, it is shown that the optimal stopping time tau is of "bang-bang" form: it is either optimal to stop at time 0 or at time T. For the case of random walk, the rule tau=T is optimal if the steps of the walk stoc…