Abstract
We price discretely monitored options when the underlying evolves according to different exponential Lévy processes. By geometric randomization of the option maturity, we transform the n-steps backward recursion that arises in option pricing into an integral equation. The option price is then obtained solving n independent integral equations by a suitable quadrature method. Since the integral equations are mutually independent, we can exploit the potentiality of a grid computing architecture. The primary performance disadvantage of grids is the slow communication speeds between nodes. However, our algorithm is well-suited for grid computing since the integral equations can be solved in parallel, without the need to communicate intermediate results between processors. Moreover, numerical experiments on a cluster architecture show the good scalability properties of our algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
