Papers
Topics
Authors
Recent
2000 character limit reached

Dual attainment for the martingale transport problem

Published 11 May 2017 in math.PR | (1705.04273v1)

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.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.