Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T11:31:16.081Z Has data issue: false hasContentIssue false

Recursive formula for the double-barrier Parisian stopping time

Published online by Cambridge University Press:  28 March 2018

Angelos Dassios*
Affiliation:
London School of Economics and Political Science
Jia Wei Lim*
Affiliation:
University of Bristol
*
* Postal address: Department of Statistics, London School of Economics and Political Science, Houghton Street, London WC2A 2AE, UK. Email address: a.dassios@lse.ac.uk
** Postal address: School of Mathematics, University of Bristol, University Walk, Bristol BS8 1TW, UK. Email address: jl14400@bristol.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 2018