Abstract

We propose an efficient computational method based on continuous-time Markov chain (CTMC) approximation to compute the distributions of the speed and duration of drawdown for general one-dimensional (1D) time-homogeneous Markov processes. We derive linear systems for the Laplace transforms of drawdown quantities and show how to solve them efficiently by recursion. In addition, we prove the convergence of our method and obtain a sharp estimate of the convergence rate under some assumptions. As applications, we consider pricing two financial options that provide protection against drawdown risk. Finally, we demonstrate the accuracy and efficiency of our method through extensive numerical experiments.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call