Related papers: Optimal Stopping in General Predictable Framework
We use probabilistic methods to characterise time dependent optimal stopping boundaries in a problem of multiple optimal stopping on a finite time horizon. Motivated by financial applications we consider a payoff of immediate stopping of…
Consider a set of discounted optimal stopping problems for a one-parameter family of objective functions and a fixed diffusion process, started at a fixed point. A standard problem in stochastic control/optimal stopping is to solve for the…
We investigate the stability of equilibrium-induced optimal values with respect to (w.r.t.) reward functions $f$ and transition kernels $Q$ for time-inconsistent stopping problems under nonexponential discounting in discrete time. First,…
We study a specific class of finite-horizon mean field optimal stopping problems by means of the dynamic programming approach. In particular, we consider problems where the state process is not affected by the stopping time. Such problems…
We propose a novel group of Gaussian Process based algorithms for fast approximate optimal stopping of time series with specific applications to financial markets. We show that structural properties commonly exhibited by financial time…
In the spirit of [Surya07'], we develop an average problem approach to prove the optimality of threshold type strategies for optimal stopping of L\'evy models with a continuous additive functional (CAF) discounting. Under spectrally…
Optimal stopping problems consider the question of deciding when to stop an observation-generating process in order to maximize a return. We examine the problem of simultaneously learning and planning in such domains, when data is collected…
Explicit solution of an infinite horizon optimal stopping problem for a Levy processes with a polynomial reward function is given, in terms of the overall supremum of the process, when the solution of the problem is one-sided. The results…
We present a methodology for obtaining explicit solutions to infinite time horizon optimal stopping problems involving general, one-dimensional, It\^o diffusions, payoff functions that need not be smooth and state-dependent discounting.…
We consider an optimal stopping problem with n correlated offers where the goal is to design a (randomized) stopping strategy that maximizes the expected value of the offer in the sequence at which we stop. Instead of assuming to know the…
A novel quickest detection setting is proposed which is a generalization of the well-known Bayesian change-point detection model. Suppose \{(X_i,Y_i)\}_{i\geq 1} is a sequence of pairs of random variables, and that S is a stopping time with…
Given two probability measures $\mu, \nu$ on $\mathbb{R}^d$, in subharmonic order, we describe optimal stopping times $\tau$ that maximize/minimize the cost functional $\mathbb{E} |B_0 - B_\tau|^{\alpha}$, $\alpha > 0$, where $(B_t)_t$ is…
We propose a new approach to solve optimal stopping problems via simulation. Working within the backward dynamic programming/Snell envelope framework, we augment the methodology of Longstaff-Schwartz that focuses on approximating the…
We consider an optimal switching problem where the terminal reward depends on the entire control trajectory. We show existence of an optimal control by applying a probabilistic technique based on the concept of Snell envelopes. We then…
We will investigate the value and inactive region of optimal stopping and one-sided singular control problems by focusing on two fundamental ratios. We shall see that these ratios unambiguously characterize the solution, although usually…
We present a solution to an optimal stopping problem for a process with a wide-class of novel dynamics. The dynamics model the support/resistance line concept from financial technical analysis.
This paper concerns optimal stopping problems driven by the running maximum of a spectrally negative L\'{e}vy process $X$. More precisely, we are interested in modifications of the Shepp-Shiryaev optimal stopping problem [Avram, Kyprianou…
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 \tau\le…
The best arm identification problem requires identifying the best alternative (i.e., arm) in active experimentation using the smallest number of experiments (i.e., arm pulls), which is crucial for cost-efficient and timely decision-making…
We study the properties of the free boundaries and the corresponding hitting times in the context of optimal stopping in discrete time. We first prove the continuity of the map from the boundaries to the expected value of the corresponding…