Bass martingales need not stretch
Mathias Beiglböck, Manuel Hasenbichler, Gudmund Pammer
Abstract
In classical optimal transport, the equivalence of optimality, convex gradient structure, and cyclical monotonicity is a central paradigm. Known counterexamples to this equivalence rely on carefully constructed costs. In contrast, we show that this equivalence can fail in martingale transport in dimension d 2: already for the canonical martingale Benamou-Brenier problem and irreducible marginals we have the strict inclusions \[ optimality \;⊂neq \; (Bass) convex gradient structure \;⊂neq\; martingale cyclical monotonicity\, . \] However, under the stronger assumption of strict irreducibility, we establish that these three notions coincide. Understanding when the gradient structure guarantees optimality is also of practical relevance, since algorithms based on the Bass gradient representation are used in financial model calibration. All our counterexamples are based on the following phenomenon: for d2, there exist two one-step martingales X,Y with the same initial and terminal laws, and a convex function ψ such that \[ 0= E[ E[ψ(Y1) Y0]-ψ(Y0)] < E[ E[ψ(X1) X0]-ψ(X0)] <∞. \]
Create a lesson
Related papers
Sublinear multi-type preferential attachment
Anna Ben-Hamou, Nicolas Broutin, Camille Cazaux
Uniform Central Limit Theorems for Degree Distributions of Sparse Graphon Models
Robert Lunde, Soumendra Lahiri
Matching Random Point Sets with Minimum Distortion
Itai Benjamini, Mark Braverman, Elad Tzalik et al.
Uniqueness and full coverage in k-neighbor graphs
David Coupier, Benoît Henry, Benedikt Jahnel et al.
Universality of smallest singular values of random row submatrices and phase retrieval problems
Shu Wen, Christian E. Häggblom, Xiufan Yang
The Cost of Minimal Completeness: Gamma-to-Delta Aliasing in Discrete Markets
Akihiro Tanaka