English

Distributionally Robust Martingale Optimal Transport

Probability 2021-12-01 v2 Optimization and Control Statistics Theory Computational Finance Statistics Theory

Abstract

We study the problem of bounding path-dependent expectations (within any finite time horizon dd) over the class of discrete-time martingales whose marginal distributions lie within a prescribed tolerance of a given collection of benchmark marginal distributions. This problem is a relaxation of the martingale optimal transport (MOT) problem and is motivated by applications to super-hedging in financial markets. We show that the empirical version of our relaxed MOT problem can be approximated within O(n1/2)O\left( n^{-1/2}\right) error where nn is the number of samples of each of the individual marginal distributions (generated independently) and using a suitably constructed finite-dimensional linear programming problem.

Keywords

Cite

@article{arxiv.2106.07191,
  title  = {Distributionally Robust Martingale Optimal Transport},
  author = {Zhengqing Zhou and Jose Blanchet and Peter W. Glynn},
  journal= {arXiv preprint arXiv:2106.07191},
  year   = {2021}
}
R2 v1 2026-06-24T03:09:34.131Z