Lattice Option Pricing By Multidimensional Interpolation
Vladislav Kargin
Abstract
This note proposes a method for pricing high-dimensional American options based on modern methods of multidimensional interpolation. The method allows using sparse grids and thus mitigates the curse of dimensionality. A framework of the pricing algorithm and the corresponding interpolation methods are discussed, and a theorem is demonstrated that suggests that the pricing method is less vulnerable to the curse of dimensionality. The method is illustrated by an application to rainbow options and compared to Least Squares Monte Carlo and other benchmarks.
Create a lesson
Related papers
Multiorder Fractional Operators: The Conformable Multiorder Derivative and Its Associated Multiorder Integral
Carlos E Cadenas R
From Umbral Hyperbolic Integrals to a Cotangent Coefficient Formula for the Mittag Leffler Polynomials
Luc Ramsès Talla Waffo
Largest Circle Enclosing Exactly n Interior Lattice Points. II
Jianqiang Zhao
Completeness of the Fuzzy Order on Fuzzy Numbers
Mingchun Xie
Study of the algebra of smooth integro-differential operators with applications
Ahmad Haghany, Adel Kassaian
Parity-Sensitive Fourier Uncertainty and Zero-Set Rigidity on the Finite Parabola
Dongwei Li