English

Dual attainment for the martingale transport problem

Probability 2017-05-12 v1

Abstract

We investigate existence of dual optimizers in one-dimensional martingale optimal transport problems. While [BNT16] established such existence for weak (quasi-sure) duality, [BHP13] showed existence for the natural stronger pointwise duality may fail even in regular cases. We establish that (pointwise) dual maximizers exist when yc(x,y)y\mapsto c(x,y) is convex, or equivalent to a convex function. It follows that when marginals are compactly supported, the existence holds when the cost c(x,y)c(x,y) is twice continuously differentiable in yy. Further, this may not be improved as we give examples with c(x,)C2ϵc(x,\cdot)\in C^{2-\epsilon}, ϵ>0\epsilon >0, where dual attainment fails. Finally, when measures are compactly supported, we show that dual optimizers are Lipschitz if cc is Lipschitz.

Keywords

Cite

@article{arxiv.1705.04273,
  title  = {Dual attainment for the martingale transport problem},
  author = {Mathias Beiglboeck and Tongseok Lim and Jan Obłój},
  journal= {arXiv preprint arXiv:1705.04273},
  year   = {2017}
}
R2 v1 2026-06-22T19:44:22.898Z