Abstract

This paper presents a new methodology to price European and American Asian options on a recombining binomial process. The method uses state descriptions for bundles of paths rather than for individual paths, thus reducing the amount of computation needed. Depending on the size of the problem and the availability of computational resources, our methods give either an exact solution or an approximate solution with upper and lower bounds on its error. In comparison to other approaches, our methods are both more nearly accurate and very fast.

Full Text
Published version (Free)

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 call