An analytic recursive method for optimal multiple stopping: Canadization and phase-type fitting
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 computation involves a distribution of the Levy process at a constant horizon and hence the solutions in general cannot be attained analytically. Motivated by the maturity randomization (Canadization) technique by Carr (1998), we approximate the refraction times by independent, identically distributed Erlang random variables. In addition, fitting random jumps to phase-type distributions, our method involves repeated integrations with respect to the resolvent measure written in terms of the scale function of the underlying Levy process. We derive a recursive algorithm to compute the value function in closed form, and sequentially determine the optimal exercise thresholds. A series of numerical examples are provided to compare our analytic formula to results from Monte Carlo simulation.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Optimal Multiple Stopping with Negative Discount Rate and Random Refraction Times under Levy Models
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 lo…
Deep Learning for the Multiple Optimal Stopping Problem
This paper presents a novel deep learning framework for solving multiple optimal stopping problems in high dimensions. While deep learning has recently shown promise for single stopping problems, the multiple exercise ca…
The convergence rate from discrete to continuous optimal investment stopping problem
We study the optimal investment stopping problem in both continuous and discrete case, where the investor needs to choose the optimal trading strategy and optimal stopping time concurrently to maximize the expected utili…
Sequential Design for Optimal Stopping Problems
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 appr…
Active LearningConformal Recursive Feature Elimination
Unlike traditional statistical methods, Conformal Prediction (CP) allows for the determination of valid and accurate confidence levels associated with individual predictions based only on exchangeability of the data. We …
Conformal Predictionfeature selectionvalid