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… Click to show full abstract
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.
               
Click one of the above tabs to view related content.