Table of Contents
Fetching ...

Improved model-free bounds for multi-asset options using option-implied information and deep learning

Evangelia Dragazi, Shuaiqiang Liu, Antonis Papapantoleon

TL;DR

The paper addresses model-free bounds for $d$-asset options under dependence uncertainty with additional market information, formalized by $\mathcal{Q}=\{ \mu: \mu_j=\nu_j, \int \phi_i \,d\mu=p_i \}$. It establishes a fundamental theorem of asset pricing (no uniform strong arbitrage iff $\mathcal{Q}\neq\emptyset$) and a superhedging duality $\Phi(f)=\max_{\mu\in\mathcal{Q}}\int f\,d\mu$, enabling a dual formulation over trading strategies. A penalized neural-network scheme is proposed to solve the dual problem, with convergence $\Phi^m_{\theta,\gamma}(f) \to \Phi(f)$ as $m,\gamma\to\infty$, and computation scales linearly with the number of assets. Numerical experiments on artificial data show that additional option-implied information sharpens bounds, especially when information is of the same payoff structure as the target and thus most relevant for accuracy versus efficiency. The approach supports fast, scalable pricing and hedging under dependence uncertainty and data-driven market information, guiding practitioners to prioritize relevant information in high-dimensional settings.

Abstract

We consider the computation of model-free bounds for multi-asset options in a setting that combines dependence uncertainty with additional information on the dependence structure. More specifically, we consider the setting where the marginal distributions are known and partial information, in the form of known prices for multi-asset options, is also available in the market. We provide a fundamental theorem of asset pricing in this setting, as well as a superhedging duality that allows to transform the maximization problem over probability measures in a more tractable minimization problem over trading strategies. The latter is solved using a penalization approach combined with a deep learning approximation using artificial neural networks. The numerical method is fast and the computational time scales linearly with respect to the number of traded assets. We finally examine the significance of various pieces of additional information. Empirical evidence suggests that "relevant" information, i.e. prices of derivatives with the same payoff structure as the target payoff, are more useful that other information, and should be prioritized in view of the trade-off between accuracy and computational efficiency.

Improved model-free bounds for multi-asset options using option-implied information and deep learning

TL;DR

The paper addresses model-free bounds for -asset options under dependence uncertainty with additional market information, formalized by . It establishes a fundamental theorem of asset pricing (no uniform strong arbitrage iff ) and a superhedging duality , enabling a dual formulation over trading strategies. A penalized neural-network scheme is proposed to solve the dual problem, with convergence as , and computation scales linearly with the number of assets. Numerical experiments on artificial data show that additional option-implied information sharpens bounds, especially when information is of the same payoff structure as the target and thus most relevant for accuracy versus efficiency. The approach supports fast, scalable pricing and hedging under dependence uncertainty and data-driven market information, guiding practitioners to prioritize relevant information in high-dimensional settings.

Abstract

We consider the computation of model-free bounds for multi-asset options in a setting that combines dependence uncertainty with additional information on the dependence structure. More specifically, we consider the setting where the marginal distributions are known and partial information, in the form of known prices for multi-asset options, is also available in the market. We provide a fundamental theorem of asset pricing in this setting, as well as a superhedging duality that allows to transform the maximization problem over probability measures in a more tractable minimization problem over trading strategies. The latter is solved using a penalization approach combined with a deep learning approximation using artificial neural networks. The numerical method is fast and the computational time scales linearly with respect to the number of traded assets. We finally examine the significance of various pieces of additional information. Empirical evidence suggests that "relevant" information, i.e. prices of derivatives with the same payoff structure as the target payoff, are more useful that other information, and should be prioritized in view of the trade-off between accuracy and computational efficiency.
Paper Structure (8 sections, 6 theorems, 53 equations, 5 figures, 2 tables)

This paper contains 8 sections, 6 theorems, 53 equations, 5 figures, 2 tables.

Key Result

Theorem 2.2

There does not exist a uniform strong arbitrage strategy in the market if and only if the set $\mathcal{Q}$ is non empty.

Figures (5)

  • Figure 1.1: Illustration of the interaction between model-free and model-specific settings.
  • Figure 5.1: Model-free upper bounds for the price of a three-asset call-on-max option with strike price $K=6$, in the different cases outlined above.
  • Figure 5.2: Model-free bounds for various strikes using the setting \ref{['E11']}--\ref{['E15']} on the left, and using the setting \ref{['E16']}--\ref{['E19']} on the right.
  • Figure 5.3: Model-free bounds for various strikes using the setting \ref{['E20']}--\ref{['E23']}.
  • Figure 5.4: Model-free bounds for various strikes using the setting \ref{['E20']}, \ref{['E24']}--\ref{['E28']}.

Theorems & Definitions (12)

  • Definition 2.1
  • Theorem 2.2: Fundamental Theorem
  • Theorem 2.3: Superhedging Duality
  • Proposition 2.4
  • proof
  • Lemma 2.5
  • proof
  • Proposition 2.6
  • proof
  • proof : Proof of Theorem \ref{['thm:FTAP']}
  • ...and 2 more