2017
DOI: 10.48550/arxiv.1703.10588
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Multiperiod Martingale Transport

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
5
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 0 publications
1
5
0
Order By: Relevance
“…It thus seems natural that an improved understanding of an n-marginal martingale transport problem can be obtained based on the multi-marginal Skorokhod embedding problem. Indeed this is exemplified in Theorem 2.16 below, where we use a multi-marginal embedding to establish an n-period version of the martingale monotone transport plan, and recover similar results to recent work of Nutz, Stebegg, and Tan [46].…”
Section: • Martingale Optimal Transportsupporting
confidence: 68%
See 1 more Smart Citation
“…It thus seems natural that an improved understanding of an n-marginal martingale transport problem can be obtained based on the multi-marginal Skorokhod embedding problem. Indeed this is exemplified in Theorem 2.16 below, where we use a multi-marginal embedding to establish an n-period version of the martingale monotone transport plan, and recover similar results to recent work of Nutz, Stebegg, and Tan [46].…”
Section: • Martingale Optimal Transportsupporting
confidence: 68%
“…Remark 2.17. In the final stage of writing this article we learned of the work of Nutz, Stebegg, and Tan [46] on multi-period martingale optimal transport which (among various further results) provides an n-marginal version of the monotone martingale transport plan. Their methods are rather different from the ones employed in this article and in particular not related to the Skorokhod problem.…”
Section: 26mentioning
confidence: 99%
“…For background on Monge-Kantorovich transport, we refer to [2,55,56,60,61]. Recently, a rich literature has emerged around martingale transport and model uncertainty; see [41,53,59] for surveys and, e.g., [1,10,15,16,17,18,23,27,30,31,32,50,52,62] for models in discrete time, [4,14,20,21,24,25,26,36,37,40,49,51,57,58] for continuous time, and [3,7,8,19,22,33,34,35,39,42,46,54] for related Skorokhod embedding and mimicking problems.…”
Section: Decreasing Supermartingale Transportmentioning
confidence: 99%
“…The one-dimensional discrete-time martingale optimal transport problem is by now well understood due to the seminal work of [BJ16] for the geometric characterization of optimizers and [BNT17] for a complete duality theory, see also [BLO17]. This was extended to cover the discrete-time multi-marginal problem in [NST17]. In higher dimensions, a complete picture for the discrete-time problem is still missing.…”
Section: Introductionmentioning
confidence: 99%