ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2106.07191
21
1
v1v2 (latest)

Distributionally Robust Martingale Optimal Transport

14 June 2021
Zhengqing Zhou
Jose H. Blanchet
Peter Glynn
    OT
ArXiv (abs)PDFHTML
Abstract

We study the problem of bounding path-dependent expectations (within any finite time horizon ddd) 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(n−1/2)O\left( n^{-1/2}\right)O(n−1/2) error where nnn is the number of samples of each of the individual marginal distributions (generated independently) and using a suitably constructed finite-dimensional linear programming problem.

View on arXiv
Comments on this paper