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 nested simulation. As a main feature, in a possibly large family of optimal martingales the algorithm efficiently selects a martingale that is as close as possible to the Doob martingale. As a result, one obtains the dual upper bound for the optimal stopping problem with low variance.
We develop a martingale approach for studying continuous-time stochastic differential games of control and stopping, in a non-Markovian framework and with the control affecting only the drift term of the state-process. Under appropriate conditions, we show that the game has a value and construct a saddle pair of optimal control and stopping strategies. Crucial in this construction is a characterization of saddle pairs in terms of pathwise and martingale properties of suitable quantities.
We solve the martingale optimal transport problem for cost functionals represented by optimal stopping problems. The measure-valued martingale approach developed in ArXiv: 1507.02651 allows us to obtain an equivalent infinite-dimensional controller-stopper problem. We use the stochastic Perron's method and characterize the finite dimensional approximation as a viscosity solution to the corresponding HJB equation. It turns out that this solution is the concave envelope of the cost function with respect to the atoms of the terminal law. We demonstrate the results by finding explicit solutions fo…
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.
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.
Given a random time, we characterize the set of martingales for which the stopping theorems still hold. We also investigate how the stopping theorems are modified when we consider arbitrary random times. To this end, we introduce some families of martingales with remarkable properties. We also investigate, in the Brownian setting, the relationships between a given random time and the underlying Brownian Motion in the progressively enlarged filtration with respect to this random time.
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 equivalent zero-sum game of control and stopping, between an agent (the "stopper") who chooses the termination time of the game, and an agent (the "controller", or "nature") who selects the probability measure.
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.
We present a short and self-contained proof of the following result: a random time is an honest time that avoids all stopping times if and only if it coincides with the (last) time of maximum of a nonnegative local martingale with zero terminal value and no jumps while at its running supremum, where the latter running supremum process is continuous. Illustrative examples involving local martingales with discontinuous paths are provided.
We address an optimal stopping problem over the set of Bermudan-type strategies $Θ$ (which we understand in a more general sense than the stopping strategies for Bermudan options in finance) and with non-linear operators (non-linear evaluations) assessing the rewards, under general assumptions on the non-linear operators $ρ$. We provide a characterization of the value family V in terms of what we call the ($ρ$,$Θ$) -Snell envelope of the pay-off family. We establish a Dynamic Programming Principle. We provide an optimality criterion in terms of a ($ρ$,$Θ$) -martingale property of V on a stocha…
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…
Let $X$ be a progressively measurable, almost surely right-continuous stochastic process such that $X_τ\in L^1$ and $E[X_τ] = E[X_0]$ for each finite stopping time $τ$. In 2006, Cherny showed that $X$ is then a uniformly integrable martingale provided that $X$ is additionally nonnegative. Cherny then posed the question whether this implication also holds even if $X$ is not necessarily nonnegative. We provide an example that illustrates that this implication is wrong, in general. If, however, an additional integrability assumption is made on the limit inferior of $|X|$ then the implication hold…
We consider a class of time-inhomogeneous optimal stopping problems and we provide sufficient conditions on the data of the problem that guarantee monotonicity of the optimal stopping boundary. In our setting, time-inhomogeneity stems not only from the reward function but, in particular, from the time dependence of the drift coefficient of the one-dimensional stochastic differential equation (SDE) which drives the stopping problem. In order to obtain our results, we mostly employ probabilistic arguments: we use a comparison principle between solutions of the SDE computed at different starting …
We present a methodology for obtaining explicit solutions to infinite time horizon optimal stopping problems involving general, one-dimensional, Itô diffusions, payoff functions that need not be smooth and state-dependent discounting. This is done within a framework based on dynamic programming techniques employing variational inequalities and links to the probabilistic approaches employing $r$-excessive functions and martingale theory. The aim of this paper is to facilitate the the solution of a wide variety of problems, particularly in finance or economics.
In this paper, we provide a solution to two problems which have been open in default time modeling in credit risk. We first show that if $τ$ is an arbitrary random (default) time such that its Azéma's supermartingale $Z_t^τ=¶(τ>t|\F_t)$ is continuous, then $τ$ avoids stopping times. We then disprove a conjecture about the equality between the hazard process and the martingale hazard process, which first appeared in \cite{jenbrutk1}, and we show how it should be modified to become a theorem. The pseudo-stopping times, introduced in \cite{AshkanYor}, appear as the most general class of random ti…
This paper proves the existence of optimal stopping times via elementary functional analytic arguments. The problem is first relaxed into a convex optimization problem over a closed convex subset of the unit ball of the dual of a Banach space. The existence of optimal solutions then follows from the Banach--Alaoglu compactness theorem and the Krein--Millman theorem on extreme points of convex sets. This approach seems to give the most general existence results known to date. Applying convex duality to the relaxed problem gives a dual problem and optimality conditions in terms of martingales th…
Marginal structural models were introduced in order to provide estimates of causal effects from interventions based on observational studies in epidemiological research. The key point is that this can be understood in terms of Girsanov's change of measure. This offers a mathematical interpretation of marginal structural models that has not been available before. We consider both a model of an observational study and a model of a hypothetical randomized trial. These models correspond to different martingale measures -- the observational measure and the randomized trial measure -- on some underl…
Let $G$ be a semimartingale, and $S$ its Snell envelope. Under the assumption that $G\in\mathcal{H}^1$, we show that the finite-variation part of $S$ is absolutely continuous with respect to the decreasing part of the finite-variation part of $G$. In the Markovian setting, this enables us to identify sufficient conditions for the value function of the optimal stopping problem to belong to the domain of the extended (martingale) generator of the underlying Markov process. We then show that the \textit{dual} of the optimal stopping problem is a stochastic control problem for a controlled Markov …
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.
We consider the game-theoretic approach to time-inconsistent stopping of a one-dimensional diffusion where the time-inconsistency is due to the presence of a non-exponential (weighted) discount function. In particular, we study (weak) equilibria for this problem in a novel class of mixed (i.e., randomized) stopping times based on a local time construction of the stopping intensity. For a general formulation of the problem we provide a verification theorem giving sufficient conditions for mixed (and pure) equilibria in terms of a set of variational inequalities, including a smooth fit condition…
We propose an alternative approach for solving a number of well-studied optimal stopping problems for Lévy processes. Instead of the usual method of guess-and-verify based on martingale properties of the value function, we suggest a more direct method by showing that the general theory of optimal stopping for strong Markov processes together with some elementary observations imply that the stopping set must be of a certain form for the optimal stopping problems we consider. The independence of increments and the strong Markov property of Lévy processes then allow us to use straightforward opti…
We analyze an optimal stopping problem with a series of inequality-type and equality-type expectation constraints in a general non-Markovian framework. We show that the optimal stopping problem with expectation constraints (OSEC) in an arbitrary probability setting is equivalent to the constrained problem in weak formulation (optimization over joint laws of stopping rules with Brownian motion and state dynamics on an enlarged canonical space) and thus the OSEC value. Using a martingale-problem formulation, we make an equivalent characterization of the probability classes in weak formulation, w…
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…
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…
In this paper we study the problem of stopping a Brownian bridge $X$ in order to maximise the expected value of an exponential gain function. In particular, we solve the stopping problem $$\sup_{0\le τ\le 1}\mathsf{E}[\mathrm{e}^{X_τ}]$$ which was posed by Ernst and Shepp in their paper [Commun. Stoch. Anal., 9 (3), 2015, pp. 419--423] and was motivated by bond selling with non-negative prices. Due to the non-linear structure of the exponential gain, we cannot rely on methods used in the literature to find closed-form solutions to other problems involving the Brownian bridge. Instead, we devel…
In this article we study an optimal stopping/optimal control problem which models the decision facing a risk-averse agent over when to sell an asset. The market is incomplete so that the asset exposure cannot be hedged. In addition to the decision over when to sell, the agent has to choose a control strategy which corresponds to a feasible wealth process. We formulate this problem as one involving the choice of a stopping time and a martingale. We conjecture the form of the solution and verify that the candidate solution is equal to the value function. The interesting features of the solution …
In this paper we consider a method of solving optimal stopping problems in discrete and continuous time based on their dual representation. A novel and generic simulation-based optimization algorithm not involving nested simulations is proposed and studied. The algorithm involves the optimization of a genuinely penalized dual objective functional over a class of adapted martingales. We prove the convergence of the proposed algorithm and demonstrate its efficiency for optimal stopping problems arising in option pricing.
Let $X$ be a bounded càdlàg process with positive jumps defined on the canonical space of continuous paths. We consider the problem of optimal stopping the process $X$ under a nonlinear expectation operator $\cE$ defined as the supremum of expectations over a weakly compact family of nondominated measures. We introduce the corresponding nonlinear Snell envelope. Our main objective is to extend the Snell envelope characterization to the present context. Namely, we prove that the nonlinear Snell envelope is an $\cE-$supermartingale, and an $\cE-$martingale up to its first hitting time of the obs…
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.
We adapt ideas and concepts developed in optimal transport (and its martingale variant) to give a geometric description of optimal stopping times of Brownian motion subject to the constraint that the distribution of the stopping time is a given probability. The methods work for a large class of cost processes. (At a minimum we need the cost process to be measurable and adapted. Continuity assumptions can be used to guarantee existence of solutions.) We find that for many of the cost processes one can come up with, the solution is given by the first hitting time of a barrier in a suitable phase…
In this paper, we first establish the reflected backward stochastic difference equations with finite state (FS-RBSDEs for short). Then we explore the Existence and Uniqueness Theorem as well as the Comparison Theorem by "one step" method. The connections between FS-RBSDEs and optimal stopping time problems are investigated and we also show that the optimal stopping problems with multiple priors under Knightian uncertainty is a special case of our FS-RBSDEs. As a byproduct we develop the general theory of g-martingales in discrete time with finite state including Doob-Mayer Decomposition Theore…
We develop a method to solve, theoretically and numerically, general optimal stopping problems. Our general setting allows for multiple exercise rights, i.e., optimal multiple stopping, for a robust evaluation that accounts for model uncertainty, and for general reward processes driven by multi-dimensional jump-diffusions. Our approach relies on first establishing robust martingale dual representation results for the multiple stopping problem that satisfy appealing pathwise optimality (i.e., almost sure) properties. Next, we exploit these theoretical results to develop upper and lower bounds t…
We provide a complete characterisation of the Root solution to the Skorokhod embedding problem (SEP) by means of an optimal stopping formulation. Our methods are purely probabilistic and the analysis relies on a tailored time-reversal argument. This approach allows us to address the long-standing question of a multiple marginals extension of the Root solution of the SEP. Our main result establishes a complete solution to the n-marginal SEP using first hitting times of barrier sets by the time-space process. The barriers are characterised by means of a recursive sequence of optimal stopping pro…
The Skorokhod embedding problem aims to represent a given probability measure on the real line as the distribution of Brownian motion stopped at a chosen stopping time. In this paper, we consider an extension of the optimal Skorokhod embedding problem to the case of finitely-many marginal constraints. Using the classical convex duality approach together with the optimal stopping theory, we obtain the duality results which are formulated by means of probability measures on an enlarged space. We also relate these results to the problem of martingale optimal transport under multiple marginal cons…
In this paper we introduce and study the concept of optimal and surely optimal dual martingales in the context of dual valuation of Bermudan options, and outline the development of new algorithms in this context. We provide a characterization theorem, a theorem which gives conditions for a martingale to be surely optimal, and a stability theorem concerning martingales which are near to be surely optimal in a sense. Guided by these results we develop a framework of backward algorithms for constructing such a martingale. In turn this martingale may then be utilized for computing an upper bound o…
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…
This paper studies a discrete-time optimal switching problem on a finite horizon. The underlying model has a running reward, terminal reward and signed (positive and negative) switching costs. Using the martingale approach to optimal stopping problems, we extend a well known explicit dynamic programming method for computing the value function and the optimal strategy to the case of signed switching costs.
We provide an extension of the explicit solution of a mixed optimal stopping-optimal stochastic control problem introduced by Henderson and Hobson. The problem examines wether the optimal investment problem on a local martingale financial market is affected by the optimal liquidation of an independent indivisible asset. The indivisible asset process is defined by a homogeneous scalar stochastic differential equation, and the investor's preferences are defined by a general expected utility function. The value function is obtained in explicit form, and we prove the existence of an optimal stoppi…
