Paper: arXiv 2309.08287
Authors: Jiefei Yang, Guanglian Li
Abstract
In this work, we develop a novel efficient quadrature and sparse grid based polynomial interpolation method to price American options with multiple underlying assets. The approach is based on first formulating the pricing of American options using dynamic programming, and then employing static sparse grids to interpolate the continuation value function at each time step. To achieve high efficiency, we first transform the domain from \(\mathbb{“R”}^d\) to \((-1,1)^d\) via a scaled tanh map, and then remove the boundary singularity of the resulting multivariate function over \((-1,1)^d\) by a bubble function and simultaneously, to significantly reduce the number of interpolation points. We rigorously establish that with a proper choice of the bubble function, the resulting function has bounded mixed derivatives up to a certain order, which provides theoretical underpinnings for the use of sparse grids. Numerical experiments for American arithmetic and geometric basket put options with the number of underlying assets up to 16 are presented to validate the effectiveness of the approach.
Complexity vs Empirical Score
- Math Complexity: 9.0/10
- Empirical Rigor: 7.5/10
- Quadrant: Holy Grail — high math complexity, high empirical rigor
Why this score: The paper employs advanced mathematics including sparse grids, domain transformation, bubble functions, and rigorous theoretical bounds on mixed derivatives for high-dimensional interpolation. It presents extensive numerical experiments up to 16 assets with validation of accuracy and robustness, though it lacks real-market data or specific backtesting pipelines.
Research Flowchart
flowchart TD A["Research Goal<br>Pricing American options<br>with multiple assets"] --> B["Key Methodology<br>Sparse Grid Interpolation<br>in d dimensions"] B --> C["Domain Transformation<br>ℝᵈ → (-1, 1)ᵈ via<br>scaled tanh map"] C --> D["Singularity Removal<br>Bubble function for<br>bounded mixed derivatives"] E["Data/Inputs<br>Arithmetic & Geometric<br>Basket Put Options"] --> F["Computational Process<br>Dynamic Programming<br>→ Sparse Grid Quadrature"] F --> G["Key Findings<br>Validated up to d=16 assets<br>High efficiency & accuracy"] D --> F
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper proposes a novel efficient quadrature and sparse‑grid based polynomial interpolation algorithm for pricing American options with multiple underlying assets.
Source sentence
In this work, we develop a novel efficient quadrature and sparse grid based polynomial interpolation method to price American options with multiple underlying assets.
Assumes 5
- Underlying asset prices follow correlated geometric Brownian motions under the risk‑neutral measure. model
Source sentence
assume that the prices of the underlying assets S(t) = [S1(t), . . . , Sd(t)]⊤follow the correlated geometric Brownian motions dSi(t) = (r −δi)Si(t) dt + σiSi(t) d ˜W i(t…
- The payoff of the American put option is g(S)=max(κ−Ψ(S),0) with Ψ a function of the asset vector. model
Source sentence
g(S) = max(κ −Ψ(S), 0) and g(S) = max(Ψ(S) −κ, 0), respectively, where Ψ : Rd+ →R+, and κ is the strike price.
- Dynamic programming formulation with continuation value function Ck(s) = E[e^{−rΔt}Vk+1(S(tk+1))|S(tk)=s]. model
Source sentence
Ck(s) = E[e^{−rΔt}Vk+1(S(tk+1))|S(tk) = s] for k = 0, 1, . . . , K −1.
- Domain transformation from ℝ^d to (−1,1)^d via a scaled tanh map and removal of boundary singularity by a bubble function. other
Source sentence
Rd to (−1, 1)d via a scaled tanh map, and then remove the boundary singularity of the resulting multivariate function over (−1,1)d by a bubble function
Show 1 more
- The transformed continuation function has bounded mixed derivatives up to a certain order. statistical
Source sentence
we rigorously establish that with a proper choice of the bubble function, the resulting function has bounded mixed derivatives up to a certain order
Data
- Synthetic American basket put option test cases synthetic unknown
Source sentence
Numerical experiments for American arithmetic and geometric basket put options with the number of underlying assets up to 16 are presented to validate the effectiveness of the approach.
Costs
Not applicable
Finds 2
- The proposed algorithm significantly improves over state‑of‑the‑art pricing schemes for American options with multiple assets and has rigorous theoretical guarantees. theoretical
Source sentence
our proposed algorithm significantly improves over the state-of-the-art pricing schemes for American options with multiple underlying assets and in the meanwhile has rigorous theoretical guarantee.
- Numerical experiments demonstrate excellent accuracy for basket put options with up to 16 assets, with reduced number of grid points due to the bubble function. performance
Source sentence
Numerical experiments for American basket put options with the number of underlying assets up to 16 demonstrate excellent accuracy of the approach.
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 9 related papers). Coverage is partial, so this is neither replication nor refutation.
1 paper in the archive
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.