Related papers: Quantization and martingale couplings
Based on the multidimensional irreducible paving of De March & Touzi, we provide a multi-dimensional version of the quasi sure duality for the martingale optimal transport problem, thus extending the result of Beiglb\"ock, Nutz & Touzi.…
While many questions in robust finance can be posed in the martingale optimal transport framework or its weak extension, others like the subreplication price of VIX futures, the robust pricing of American options or the construction of…
We are interested in the Wasserstein distance between two probability measures on $\R^n$ sharing the same copula $C$. The image of the probability measure $dC$ by the vectors of pseudo-inverses of marginal distributions is a natural…
We consider weak optimal problems (possibly entropically penalized) incorporating both soft and hard (including the case of the martingale condition) moment constraints. Even in the special case of the martingale optimal transport problem,…
We consider Monge-Kantorovich optimal transport problems on $\mathbb{R}^d$, $d\ge 1$, with a convex cost function given by the cumulant generating function of a probability measure. Examples include the Wasserstein-2 transport whose cost…
In this article we study a variational problem providing a way to extend for all times minimizing geodesics connecting two given probability measures, in the Wasserstein space. This is simply obtained by allowing for negative coefficients…
An analogue of the quadratic Wasserstein (or Monge-Kantorovich) distance between Borel probability measures on $\mathbf{R}^d$ has been defined in [F. Golse, C. Mouhot, T. Paul: Commun. Math. Phys. 343 (2015), 165-205] for density operators…
The basic goal of quantization for probability distribution is to reduce the number of values, which is typically uncountable, describing a probability distribution to some finite set and thus approximation of a continuous probability…
Split conformal prediction provides finite-sample marginal coverage under exchangeability, but this guarantee averages over the random calibration sample. We study instead the law of the calibration-conditional coverage induced by a…
The basic problem of optimal transportation consists in minimizing the expected costs $\mathbb {E}[c(X_1,X_2)]$ by varying the joint distribution $(X_1,X_2)$ where the marginal distributions of the random variables $X_1$ and $X_2$ are…
The quantization problem aims to find the best possible approximation of probability measures on ${\mathbb{R}}^d$ using finite, discrete measures. The Wasserstein distance is a typical choice to measure the quality of the approximation.…
Motivated by recent results on the dual formulation of optimal stopping problems, we investigate in this short paper how the knowledge of an approximating dual martingale can improve the efficiency of primal methods. In particular, we show…
We study a nonlinear multimarginal optimal transport problem arising in risk management, where the objective is to maximize a spectral risk measure of the pushforward of a coupling by a cost function. Although this problem is inherently…
We study the optimal transport between two probability measures on the real line, where the transport plans are laws of one-step martingales. A quasi-sure formulation of the dual problem is introduced and shown to yield a complete duality…
Continuity of the value of the martingale optimal transport problem on the real line w.r.t. its marginals was recently established in Backhoff-Veraguas and Pammer [2] and Wiesel [21]. We present a new perspective of this result using the…
Optimal transport provides a powerful mathematical framework with applications spanning numerous fields. A cornerstone within this domain is the $p$-Wasserstein distance, which serves to quantify the cost of transporting one probability…
Wasserstein barycenters provide a geometrically meaningful way to aggregate probability distributions, built on the theory of optimal transport. They are difficult to compute in practice, however, leading previous work to restrict their…
We consider an optimal transport problem between laws of random probability measures: given a base cost function, we build the associated OT cost between probability measures that in turn we use to define the OT cost between probability…
In this paper, we give an alternative proof of the fact that, when compounding a nonnegative probability distribution, convex ordering between the distributions of the number of summands implies convex ordering between the resulting…
Obtaining solutions to Optimal Transportation (OT) problems is typically intractable when the marginal spaces are continuous. Recent research has focused on approximating continuous solutions with discretization methods based on i.i.d.…