Efficient, exact algorithms for asian options with multiresolution lattices

Asian options are a kind of path-dependent derivative. How to price such derivatives efficiently and accurately has been a long-standing research and practical problem. This paper proposes a novel multiresolution (MR) trinomial lattice for pricing European- and American-style arithmetic Asian options. Extensive experimental work suggests that this new approach is both efficient and more accurate than existing methods. It also computes the numerical delta accurately. The MR algorithm is exact as no errors are introduced during backward induction. In fact, it may be the first exact discrete-time algorithm to break the exponential-time barrier. The MR algorithm is guaranteed to converge to the continuous-time value. Copyright Kluwer Academic Publishers 2002