# Computational Methods for Martingale Optimal Transport problems

arXiv: https://arxiv.org/abs/1710.07911 · HTML: https://mlsanity.com/paper/1710.07911/

## Key facts

- Cited by 6 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 22 Oct 2017.

## Built on by (most cited first, 6 of 6)

- [Wasserstein distributional robustness of neural networks](https://mlsanity.com/paper/2306.09844/) (2023)
- [Small Transformers Compute Universal Metric Embeddings](https://mlsanity.com/paper/2209.06788/) (2022)
- [A deep learning approach to data-driven model-free pricing and to martingale optimal transport](https://mlsanity.com/paper/2103.11435/) (2021)
- [A Sinkhorn-type Algorithm for Constrained Optimal Transport](https://mlsanity.com/paper/2403.05054/) (2024)
- [Toric Geometry of Entropic Regularization](https://mlsanity.com/paper/2202.01571/) (2022)
- [Distributionally robust risk evaluation with a causality constraint and structural information](https://mlsanity.com/paper/2203.10571/) (2022)

## Abstract (arXiv)

We establish numerical methods for solving the martingale optimal transport problem (MOT) - a version of the classical optimal transport with an additional martingale constraint on transport's dynamics. We prove that the MOT value can be approximated using linear programming (LP) problems which result from a discretisation of the marginal distributions combined with a suitable relaxation of the martingale constraint. Specialising to dimension one, we provide bounds on the convergence rate of the above scheme. We also show a stability result under only partial specification of the marginal distributions. Finally, we specialise to a particular discretisation scheme which preserves the convex ordering and does not require the martingale relaxation. We introduce an entropic regularisation for the corresponding LP problem and detail the corresponding iterative Bregman projection. We also rewrite its dual problem as a minimisation problem without constraint and solve it by computing the concave envelope of scattered data.