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

Tim Leung, Kazutoshi Yamazaki and Hongzhong Zhang

Papers from arXiv.org

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.

Date: 2015-05
New Economics Papers: this item is included in nep-cmp
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://arxiv.org/pdf/1505.07705 Latest version (application/pdf)

Related works:
Journal Article: AN ANALYTIC RECURSIVE METHOD FOR OPTIMAL MULTIPLE STOPPING: CANADIZATION AND PHASE-TYPE FITTING (2015)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1505.07705

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().