scispace - formally typeset
Search or ask a question
Author

Gudmund Pammer

Other affiliations: University of Vienna
Bio: Gudmund Pammer is an academic researcher from ETH Zurich. The author has contributed to research in topics: Mathematics & Martingale (probability theory). The author has an hindex of 5, co-authored 20 publications receiving 127 citations. Previous affiliations of Gudmund Pammer include University of Vienna.

Papers
More filters
Journal ArticleDOI
TL;DR: In this article, the authors provide general existence and duality results for weak transport problems on arbitrary Polish spaces, as well as a necessary and sufficient optimality criterion in the spirit of cyclical monotonicity.
Abstract: The optimal weak transport problem has recently been introduced by Gozlan et al. (J Funct Anal 273(11):3327–3405, 2017). We provide general existence and duality results for these problems on arbitrary Polish spaces, as well as a necessary and sufficient optimality criterion in the spirit of cyclical monotonicity. As an application we extend the Brenier–Strassen Theorem of Gozlan and Juillet (On a mixture of brenier and strassen theorems. arXiv:1808.02681, 2018) to general probability measures on $$\mathbb {R}^d$$ under minimal assumptions. A driving idea behind our proofs is to consider the set of transport plans with a new (‘adapted’) topology which seems better suited for the weak transport problem and allows to carry out arguments which are close to the proofs in the classical setup.

42 citations

Posted Content
TL;DR: In this paper, the authors give a positive answer and establish stability of the martingale transport problem, and they also apply to the weak transport problem introduced by Gozlan, Roberto, Samson and Tetali.
Abstract: Under mild regularity assumptions, the transport problem is stable in the following sense: if a sequence of optimal transport plans $\pi_1, \pi_2, \ldots$ converges weakly to a transport plan $\pi$, then $\pi$ is also optimal (between its marginals). Alfonsi, Corbetta and Jourdain asked whether the same property is true for the martingale transport problem. This question seems particularly pressing since martingale transport is motivated by robust finance where data is naturally noisy. On a technical level, stability in the martingale case appears more intricate than for classical transport since optimal transport plans $\pi$ are not characterized by a `monotonicity'-property of their support. In this paper we give a positive answer and establish stability of the martingale transport problem. As a particular case, this recovers the stability of the left curtain coupling established by Juillet. An important auxiliary tool is an unconventional topology which takes the temporal structure of martingales into account. Our techniques also apply to the the weak transport problem introduced by Gozlan, Roberto, Samson and Tetali.

38 citations

Posted Content
TL;DR: In this paper, the authors provide general existence and duality results for weak transport problems on arbitrary Polish spaces, as well as a necessary and sufficient optimality criterion in the spirit of cyclical monotonicity.
Abstract: The optimal weak transport problem has recently been introduced by Gozlan et.\ al. We provide general existence and duality results for these problems on arbitrary Polish spaces, as well as a necessary and sufficient optimality criterion in the spirit of cyclical monotonicity. As an application we extend the Brenier-Strassen Theorem of Gozlan-Juillet to general probability measures on $R^d$ under minimal assumptions. A driving idea behind our proofs is to consider the set of transport plans with a new (`adapted') topology which seems better suited for the weak transport problem and allows to carry out arguments which are close to the proofs in the classical setup.

24 citations

Posted Content
TL;DR: In this article, the authors showed that the martingale transport problem is stable under mild regularity assumptions and established the stability of the left curtain coupling established by Juillet, and they also proposed an unconventional topology which takes the temporal structure of martingales into account.
Abstract: Under mild regularity assumptions, the transport problem is stable in the following sense: if a sequence of optimal transport plans $\pi_1, \pi_2, \ldots$ converges weakly to a transport plan $\pi$, then $\pi$ is also optimal (between its marginals). Alfonsi, Corbetta and Jourdain asked whether the same property is true for the martingale transport problem. This question seems particularly pressing since martingale transport is motivated by robust finance where data is naturally noisy. On a technical level, stability in the martingale case appears more intricate than for classical transport since optimal transport plans $\pi$ are not characterized by a `monotonicity'-property of their support. In this paper we give a positive answer and establish stability of the martingale transport problem. As a particular case, this recovers the stability of the left curtain coupling established by Juillet. An important auxiliary tool is an unconventional topology which takes the temporal structure of martingales into account. Our techniques also apply to the the weak transport problem introduced by Gozlan, Roberto, Samson and Tetali.

17 citations

Posted Content
TL;DR: In this article, the authors recast several problems from different areas that can be recast in the framework of weak transport theory, such as the Schr\"odinger problem, the Brenier-Strassen theorem, optimal mechanism design, linear transfers and semimartingale transport.
Abstract: Motivated by applications to geometric inequalities, Gozlan, Roberto, Samson, and Tetali introduced a transport problem for `weak' cost functionals. Basic results of optimal transport theory can be extended to this setup in remarkable generality. In this article we collect several problems from different areas that can be recast in the framework of weak transport theory, namely: the Schr\"odinger problem, the Brenier-Strassen theorem, optimal mechanism design, linear transfers and semimartingale transport. Our viewpoint yields a unified approach and often allows to strengthen the original results.

14 citations


Cited by
More filters
BookDOI
18 Jan 2021

638 citations

Posted Content
TL;DR: In this paper, a suitable adapted version of the Wasserstein distance is proposed, which takes the temporal structure of pricing models into account, which allows to establish Lipschitz properties of hedging strategies for semimartingale models in discrete and continuous time.
Abstract: Assume that an agent models a financial asset through a measure Q with the goal to price / hedge some derivative or optimize some expected utility. Even if the model Q is chosen in the most skilful and sophisticated way, she is left with the possibility that Q does not provide an "exact" description of reality. This leads us to the following question: will the hedge still be somewhat meaningful for models in the proximity of Q? If we measure proximity with the usual Wasserstein distance (say), the answer is NO. Models which are similar w.r.t. Wasserstein distance may provide dramatically different information on which to base a hedging strategy. Remarkably, this can be overcome by considering a suitable "adapted" version of the Wasserstein distance which takes the temporal structure of pricing models into account. This adapted Wasserstein distance is most closely related to the nested distance as pioneered by Pflug and Pichler \cite{Pf09,PfPi12,PfPi14}. It allows us to establish Lipschitz properties of hedging strategies for semimartingale models in discrete and continuous time. Notably, these abstract results are sharp already for Brownian motion and European call options.

51 citations

Journal ArticleDOI
TL;DR: In this article, a suitable adapted version of the Wasserstein distance which takes the temporal structure of pricing models into account is proposed, which allows to establish Lipschitz properties of hedging strategies for semimartingale models in discrete and continuous time.
Abstract: Assume that an agent models a financial asset through a measure ℚ with the goal to price/hedge some derivative or optimise some expected utility. Even if the model ℚ is chosen in the most skilful and sophisticated way, the agent is left with the possibility that ℚ does not provide an exact description of reality. This leads us to the following question: will the hedge still be somewhat meaningful for models in the proximity of ℚ? If we measure proximity with the usual Wasserstein distance (say), the answer is No. Models which are similar with respect to the Wasserstein distance may provide dramatically different information on which to base a hedging strategy. Remarkably, this can be overcome by considering a suitable adapted version of the Wasserstein distance which takes the temporal structure of pricing models into account. This adapted Wasserstein distance is most closely related to the nested distance as pioneered by Pflug and Pichler (SIAM J. Optim. 20:1406–1420, 2009, SIAM J. Optim. 22:1–23, 2012, Multistage Stochastic Optimization, 2014). It allows us to establish Lipschitz properties of hedging strategies for semimartingale models in discrete and continuous time. Notably, these abstract results are sharp already for Brownian motion and European call options.

47 citations

Journal ArticleDOI
TL;DR: In this article, the authors provide general existence and duality results for weak transport problems on arbitrary Polish spaces, as well as a necessary and sufficient optimality criterion in the spirit of cyclical monotonicity.
Abstract: The optimal weak transport problem has recently been introduced by Gozlan et al. (J Funct Anal 273(11):3327–3405, 2017). We provide general existence and duality results for these problems on arbitrary Polish spaces, as well as a necessary and sufficient optimality criterion in the spirit of cyclical monotonicity. As an application we extend the Brenier–Strassen Theorem of Gozlan and Juillet (On a mixture of brenier and strassen theorems. arXiv:1808.02681, 2018) to general probability measures on $$\mathbb {R}^d$$ under minimal assumptions. A driving idea behind our proofs is to consider the set of transport plans with a new (‘adapted’) topology which seems better suited for the weak transport problem and allows to carry out arguments which are close to the proofs in the classical setup.

42 citations

Journal ArticleDOI
TL;DR: The motivation is the design of sampling techniques preserving the convex order in order to approximate Martingale Optimal Transport problems by using linear programming solvers and convergence of the Wasserstein projection based sampling methods as the sample sizes tend to infinity.
Abstract: Motivated by the approximation of Martingale Optimal Transport problems, we study sampling methods preserving the convex order for two probability measures $\mu$ and $ u$ on $\mathbb{R}^d$, with $ u$ dominating $\mu$. When $(X_i)_{1\le i\le I}$ (resp. $(Y_j)_{1\le j\le J}$) are i.i.d. according $\mu$ (resp. $ u$), the empirical measures $\mu_I$ and $ u_J$ are not in the convex order. We investigate modifications of $\mu_I$ (resp. $ u_J$) smaller than $ u_J$ (resp. greater than $\mu_I$) in the convex order and weakly converging to $\mu$ (resp. $ u$) as $I,J\to\infty$. In dimension 1, according to Kertz and R\"osler (1992), the set of probability measures with a finite first order moment is a lattice for the increasing and the decreasing convex orders. From this result, we can define $\mu\vee u$ (resp. $\mu\wedge u$) that is greater than $\mu$ (resp. smaller than $ u$) in the convex order. We give efficient algorithms permitting to compute $\mu\vee u$ and $\mu\wedge u$ when $\mu$ and $ u$ are convex combinations of Dirac masses. In general dimension, when $\mu$ and $ u$ have finite moments of order $\rho\ge 1$, we define the projection $\mu\curlywedge_\rho u$ (resp. $\mu\curlyvee_\rho u$) of $\mu$ (resp. $ u$) on the set of probability measures dominated by $ u$ (resp. larger than $\mu$) in the convex order for the Wasserstein distance with index $\rho$. When $\rho=2$, $\mu_I\curlywedge_2 u_J$ can be computed efficiently by solving a quadratic optimization problem with linear constraints. It turns out that, in dimension 1, the projections do not depend on $\rho$ and their quantile functions are explicit, which leads to efficient algorithms for convex combinations of Dirac masses. Last, we illustrate by numerical experiments the resulting sampling methods that preserve the convex order and their application to approximate Martingale Optimal Transport problems.

39 citations