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.
- © 2009 Pageant Media Ltd
Don’t have access? Register today to begin unrestricted access to our database of research.
Log in using your username and password
In this issue
Pricing Parisian Options by Generating Functions
