Related papers: One-sided solutions for optimal stopping problems …
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)$…
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…
Infinite horizon optimal stopping problems for a L\'evy processes with a two-sided reward function are considered. A two-sided verification theorem is presented in terms of the overall supremum and the overall infimum of the process. A…
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…
This article treats both discrete time and continuous time stopping problems for general Markov processes on the real line with general linear costs. Using an auxiliary function of maximum representation type, conditions are given to…
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 consider the optimal stopping problem consisting in, given a strong Markov process, a reward function and a discount rate, finding the stopping time such that the expected reward at the stopping time is maximum. The approach we follow,…
We consider a class of infinite-time horizon optimal stopping problems for spectrally negative Levy processes. Focusing on strategies of threshold type, we write explicit expressions for the corresponding expected payoff via the scale…
We propose an alternative approach for solving a number of well-studied optimal stopping problems for L\'evy processes. Instead of the usual method of guess-and-verify based on martingale properties of the value function, we suggest a more…
This article treats long term average impulse control problems with running costs in the case that the underlying process is a L\'evy process. Under quite general conditions we characterize the value of the control problem as the value of a…
We study optimal stopping of Feller-Markov processes to maximise an undiscounted functional consisting of running and terminal rewards. In a finite-time horizon setting, we extend classical results to unbounded rewards. In infinite horizon,…
We consider the problem of optimally stopping a general one-dimensional stochastic differential equation (SDE) with generalised drift over an infinite time horizon. First, we derive a complete characterisation of the solution to this…
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…
This paper studies an optimal stopping problem for L\'evy processes. We give a justification of the form of the Snell envelope using standard results of optimal stopping. We also justify the convexity of the value function, and without a…
We study an optimal multiple stopping problem for call-type payoff driven by a spectrally negative Levy process. The stopping times are separated by constant refraction times, and the discount rate can be positive or negative. The…
In this paper, we study the optimal multiple stopping problem under the filtration consistent nonlinear expectations. The reward is given by a set of random variables satisfying some appropriate assumptions rather than an RCLL process. We…
We revisit an absolutely-continuous version of the stochastic control problem driven by a L\'evy process. A strategy must be absolutely continuous with respect to the Lebesgue measure and the running cost function is assumed to be convex.…
We study optimal Markovian couplings of Markov processes, where the optimality is understood in terms of minimization of concave transport costs between the time-marginal distributions of the coupled processes. We provide explicit…
Controlled discrete time Markov processes are studied first with long run general discounting functional. It is shown that optimal strategies for average reward per unit time problem are also optimal for average generally discounting…
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…