Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
An optimal transport-based characterization of convex order - MaRDI portal

An optimal transport-based characterization of convex order

From MaRDI portal
Publication:6184350

DOI10.1515/DEMO-2023-0102zbMATH Open1528.60036arXiv2207.01235OpenAlexW4387757271MaRDI QIDQ6184350

Johannes Wiesel, Erica Zhang

Publication date: 24 January 2024

Published in: Dependence Modeling (Search for Journal in Brave)

Abstract: For probability measures mu,u and ho define the cost functionals �egin{align*} C(mu, ho):=sup_{piin Pi(mu, ho)} int langle x,y angle, pi(dx,dy),quad C(

u, ho):=sup_{piin Pi(

u, ho)} int langle x,y angle, pi(dx,dy), end{align*} where langlecdot,cdotangle denotes the scalar product and Pi(cdot,cdot) is the set of couplings. We show that two probability measures mu and u on mathbbRd with finite first moments are in convex order (i.e. mupreceqcu) iff C(mu,ho)leC(u,ho) holds for all probability measures ho on mathbbRd with bounded support. This generalizes a result by Carlier. Our proof relies on a quantitative bound for the infimum of intf,duintf,dmu over all 1-Lipschitz functions f, which is obtained through optimal transport duality and Brenier's theorem. Building on this result, we derive new proofs of well-known one-dimensional characterizations of convex order. We also describe new computational methods for investigating convex order and applications to model-independent arbitrage strategies in mathematical finance.


Full work available at URL: https://arxiv.org/abs/2207.01235











This page was built for publication: An optimal transport-based characterization of convex order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184350)