Click to login and read the full article.
Don’t have access? Click here to request a demo
Alternatively, Call a member of the team to discuss membership options
US and Overseas: +1 646-931-9045
UK: 0207 139 1600
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? Click here to request a demo
Alternatively, Call a member of the team to discuss membership options
US and Overseas: +1 646-931-9045
UK: 0207 139 1600
Log in using your username and password
In this issue
