Papers
Topics
Authors
Recent
2000 character limit reached

Remarks on multi-period martingale optimal transport (2506.05505v1)

Published 5 Jun 2025 in math.OC and math.PR

Abstract: We study the structural properties of multi-period martingale optimal transport (MOT). We develop new tools to address these problems, and use them to prove several uniqueness and structural results on three-period martingale optimal transport. More precisely, we establish lemmas on how and when two-period martingale couplings may be glued together to obtain multi-period martingales and which among these glueings are optimal for particular MOT problems. We use these optimality results to study limits of solutions under convergence of the cost function and obtain a corresponding linearization of the optimal cost. We go on to establish a complete characterization of limiting solutions in a three-period problem as the interaction between two of the variables vanishes. Under additional assumptions, we show uniqueness of the solution and a structural result which yields the solution essentially explicitly. For the full three-period problem, we also obtain several structural and uniqueness results under a variety of different assumptions on the marginals and cost function. We illustrate our results with a real world application, providing approximate model independent upper and lower bounds for options depending on Amazon stock prices at three different times. We compare these bounds to prices computed using certain models.

Summary

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

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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