pith. sign in

arxiv: 1705.04273 · v1 · pith:DTVVDCMQnew · submitted 2017-05-11 · 🧮 math.PR

Dual attainment for the martingale transport problem

classification 🧮 math.PR
keywords dualexistencewhenattainmentcompactlyconvexdualityepsilon
0
0 comments X
read the original 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 $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)$ is twice continuously differentiable in $y$. Further, this may not be improved as we give examples with $c(x,\cdot)\in C^{2-\epsilon}$, $\epsilon >0$, where dual attainment fails. Finally, when measures are compactly supported, we show that dual optimizers are Lipschitz if $c$ is Lipschitz.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.