Skip to Main content Skip to Navigation

Fast binomial procedures for pricing Parisian/ParAsian options

Marcellino Gaudenzi 1 Antonino Zanette 1 
1 MATHRISK - Mathematical Risk handling
Inria Paris-Rocquencourt, UPEM - Université Paris-Est Marne-la-Vallée, ENPC - École des Ponts ParisTech
Abstract : The discrete procedures for pricing Parisian/ParAsian options depend, in general, by three dimensions: time, space, time spent over the barrier. Here we present some combinatorial and lattice procedures which reduce the computational complexity to second order. In the European case the reduction was already given by Lyuu-Wu \cite{WU} and Li-Zhao \cite{LZ}, in this paper we present a more efficient procedure in the Parisian case and a different approach (again of order 2) in the ParAsian case. In the American case we present new procedures which decrease the complexity of the pricing problem for the Parisian/ParAsian knock-in options. The reduction of complexity for Parisian/ParAsian knock-out options is still an open problem.
Document type :
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Martine Verneuille Connect in order to contact the contributor
Submitted on : Tuesday, July 31, 2012 - 10:53:18 AM
Last modification on : Thursday, January 20, 2022 - 5:29:24 PM
Long-term archiving on: : Thursday, November 1, 2012 - 2:30:58 AM


Files produced by the author(s)


  • HAL Id : hal-00721958, version 1



Marcellino Gaudenzi, Antonino Zanette. Fast binomial procedures for pricing Parisian/ParAsian options. [Research Report] RR-8033, INRIA. 2012, pp.15. ⟨hal-00721958⟩



Record views


Files downloads