Article contents
Recursive formula for the double-barrier Parisian stopping time
Published online by Cambridge University Press: 28 March 2018
Abstract
In this paper we obtain a recursive formula for the density of the double-barrier Parisian stopping time. We present a probabilistic proof of the formula for the first few steps of the recursion, and then a formal proof using explicit Laplace inversions. These results provide an efficient computational method for pricing double-barrier Parisian options.
MSC classification
- Type
- Research Papers
- Information
- Copyright
- Copyright © Applied Probability Trust 2018
References
- 6
- Cited by