Affordable Access

deepdyve-link
Publisher Website

An analytic recursive method for optimal multiple stopping: Canadization and phase-type fitting

Authors
  • Leung, Tim
  • Yamazaki, Kazutoshi
  • Zhang, Hongzhong
Type
Preprint
Publication Date
May 28, 2015
Submission Date
May 28, 2015
Identifiers
DOI: 10.1142/S0219024915500326
Source
arXiv
License
Yellow
External links

Abstract

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.

Report this publication

Statistics

Seen <100 times