Related papers: A direct method for solving optimal stopping probl…
In this paper we introduce and solve a class of optimal stopping problems of recursive type. In particular, the stopping payoff depends directly on the value function of the problem itself. In a multi-dimensional Markovian setting we show…
We develop an approach for solving one-sided optimal stopping problems in discrete time for general underlying Markov processes on the real line. The main idea is to transform the problem into an auxiliary problem for the ladder height…
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…
We present a method to solve optimal stopping problems in infinite horizon for a L\'evy process when the reward function can be non-monotone. To solve the problem we introduce two new objects. Firstly, we define a random variable $\eta(x)$…
We consider the optimal stopping problem $v^{(\eps)}:=\sup_{\tau\in\mathcal{T}_{0,T}}\mathbb{E}B_{(\tau-\eps)^+}$ posed by Shiryaev at the International Conference on Advanced Stochastic Optimization Problems organized by the Steklov…
This paper concerns an optimal stopping problem driven by the running maximum of a spectrally negative Levy process X. More precisely, we are interested in capped versions of the American lookback optimal stopping problem, which has its…
We consider the optimal prediction problem of stopping a spectrally negative L\'evy process as close as possible to a given distance $b \geq 0$ from its ultimate supremum, under a squared error penalty function. Under some mild conditions,…
We use the geometry of suitably generalised potentials to solve risk-sensitive Markovian optimal stopping problems. As in the linear case due to Dynkin and Yushkievich (1967), the value function is the pointwise infimum of those functions…
In this paper we consider the following optimal stopping problem $$V^{\omega}_{\rm A}(s) = \sup_{\tau\in\mathcal{T}} \mathbb{E}_{s}[e^{-\int_0^\tau \omega(S_w) dw} g(S_\tau)],$$ where the process $S_t$ is a jump-diffusion process,…
Given a spectrally negative L\'evy process $X$ drifting to infinity, (inspired on the early ideas of Shiryaev (2002)) we are interested in finding a stopping time that minimises the $L^p$ distance ($p>1$) with $g$, the last time $X$ is…
This paper is dedicated to the investigation of a new numerical method to approximate the optimal stopping problem for a discrete-time continuous state space Markov chain under partial observations. It is based on a two-step discretization…
Our purpose is to study a particular class of optimal stopping problems for Markov processes. We justify the value function convexity and we deduce that there exists a boundary function such that the smallest optimal stopping time is the…
In this paper we study optimal stopping problems for nonlinear Markov processes driven by a McKean-Vlasov SDE and aim at solving them numerically by Monte Carlo. To this end we propose a novel regression algorithm based on the corresponding…
The optimal stopping problem for a Hunt processes on $\R$ is considered via the representation theory of excessive functions. In particular, we focus on infinite horizon (or perpetual) problems with one-sided structure, that is, there…
We propose a numerical method to approximate the value function for the optimal stopping problem of a piecewise deterministic Markov process (PDMP). Our approach is based on quantization of the post jump location---inter-arrival time Markov…
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…
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…
This paper studies a class of optimal multiple stopping problems driven by L\'evy processes. Our model allows for a negative effective discount rate, which arises in a number of financial applications, including stock loans and real…
We extend the Longstaff-Schwartz algorithm for approximately solving optimal stopping problems on high-dimensional state spaces. We reformulate the optimal stopping problem for Markov processes in discrete time as a generalized statistical…
We consider the problem of finding a stopping time that minimises the $L^1$-distance to $\theta$, the time at which a L\'evy process attains its ultimate supremum. This problem was studied in [12] for a Brownian motion with drift and a…