An analytic recursive method for optimal multiple stopping: Canadization and phase-type fitting
arXiv:1505.07705 · doi:10.1142/S0219024915500326
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.
arXiv comment30 pages, 5 figures
References in corpus (11)
- On the optimal dividend problem for a spectrally negative Lévy process
- On optimality of the barrier strategy in de Finetti's dividend problem for spectrally negative Lévy processes
- Some remarks on first passage of Levy processes, the American put and pasting principles
- A Wiener--Hopf Monte Carlo simulation technique for Lévy processes
- Optimal multiple stopping time problem
- Precautionary Measures for Credit Risk Management in Jump Models
- Maturity randomization for stochastic control problems
- Optimal Timing to Purchase Options
- American Step-Up and Step-Down Default Swaps under Levy Models
- Default Swap Games Driven by Spectrally Negative Levy Processes
- Optimal Capital Structure with Scale Effects under Spectrally Negative Levy Models