Paper: arXiv 2406.09959

Authors: Linn Engström, Sigrid Källblad, Johan Karlsson

Abstract

We introduce an efficient computational framework for solving a class of multi-marginal martingale optimal transport problems, which includes many robust pricing problems of large financial interest. Such problems are typically computationally challenging due to the martingale constraint, however, by extending the state space we can identify them with problems that exhibit a certain sequential martingale structure. Our method exploits such structures in combination with entropic regularisation, enabling fast computation of optimal solutions and allowing us to solve problems with a large number of marginals. We demonstrate the method by using it for computing robust price bounds for different options, such as lookback options and Asian options.

Complexity vs Empirical Score

  • Math Complexity: 9.2/10
  • Empirical Rigor: 3.5/10
  • Quadrant: Lab Rats — high math complexity, limited empirical testing

Why this score: The paper is highly mathematical, featuring extensive derivations on martingale optimal transport theory, duality, and entropic regularization, placing it in the Lab Rrats quadrant. The empirical rigor is limited, as the summary only mentions applying the method to compute price bounds without detailing implementation details, backtest performance, or data processing.

Research Flowchart

  flowchart TD
  A["Research Goal<br>Efficiently compute robust option price bounds<br>via multi-marginal martingale optimal transport"] --> B["Methodology: Sequential Structure +<br>Entropic Regularization"]
  B --> C["Data/Inputs<br>Observed option prices /<br>market marginals"]
  C --> D["Computational Process<br>Convex Optimization via Sinkhorn algorithm"]
  D --> E["Key Outcomes<br>1. Fast computation of optimal martingales<br>2. Robust price bounds for Lookback & Asian options"]

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 an efficient computational framework for solving multi‑marginal martingale optimal transport problems, enabling fast computation of robust option price bounds.

Source sentence
We introduce an efficient computational framework for solving a class of multi‑marginal martingale optimal transport problems, which includes many robust pricing problems of large financial interest.

Assumes 4

  • The given marginal distributions are in convex order. model
    Source sentence
    We assume that the given marginals µt, for t ∈T ⊆{0, 1, . . . , T}, are in convex order.
  • Market data consist of prices of liquidly traded call options for multiple maturities. market
    Source sentence
    For market data consisting of prices of liquidly traded call options for multiple maturities, the problem can be formulated as a multi‑marginal martingale optimal transport (MOT) problem.
  • Payoff functions can be written as a sum of pairwise‑decoupled terms. model
    Source sentence
    interested in pricing path‑dependent derivatives whose payoff function φ
  • Entropic regularisation is applied to the reformulated optimal transport problem. other
    Source sentence
    Our method exploits such structures in combination with entropic regularisation, enabling fast computation of optimal solutions

Data

  • Liquidly traded call options (multiple maturities) options unknown
    Source sentence
    For market data consisting of prices of liquidly traded call options for multiple maturities, the problem can be formulated as a multi‑marginal martingale optimal transport (MOT) problem
  • Synthetic marginal distributions for numerical examples synthetic unknown
    Source sentence
    we, in one of our numerical examples (see Section 5.2), address an MOT problem with more than 50 marginals, where each marginal is supported on a large number of points

Costs

Not applicable The paper reports no trading or execution result.

Finds 4

  • The algorithm can handle MOT problems with more than 50 marginals, each supported on many points. theoretical
    Source sentence
    we, in one of our numerical examples (see Section 5.2), address an MOT problem with more than 50 marginals, where each marginal is supported on a large number of points
  • Numerical experiments suggest that up to 30 marginals can be used without significant accumulation of Newton residual errors. statistical
    Source sentence
    Our numerical experiments suggests that 30 marginals can be used without this being an issue
  • For the upper‑bound solution with regularisation parameter ε = 0.02, intermediate marginals are close to the terminal marginal, illustrating an early‑transport case. theoretical
    Source sentence
    The upper bound solution (computed using ε = 0.02) is shown in Figure 2b; for this solution, we note that the intermediate marginals are close to the terminal marginal
  • The robust price for the Azéma–Yor martingale comparison example is EQ[XAY_T] = 0.6133. other
    Source sentence
    The corresponding problem value, the robust price, is EQ[XAY_T] = 0.6133

Checked by others

No other paper in the archive has been found to support or contradict these findings (compared with 28 related papers). Coverage is partial, so this is neither replication nor refutation.

Cited by 1 paper in the archive (1 by independent authors)

Code

No repository by the authors found in the paper.

Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.