Pricing Parisian Options by Generating Functions

Abstract

We provide new and discrete time combinatorial approaches to evaluate Parisian options. By using generating functions, a very useful tool in lattice path enumeration, the computation of consecutive and cumulative Parisian options is significantly simplified. This leads to combinatorial algorithms that reduce the computational complexity and produce highly accurate prices.