Optimal and better transport plans
From MaRDI portal
Publication:1011424
DOI10.1016/j.jfa.2009.01.013zbMath1157.49019arXiv0802.0646OpenAlexW2128675698MaRDI QIDQ1011424
Mathias Beiglböck, Walter Schachermayer, Gabriel Maresch, Martin Goldstern
Publication date: 8 April 2009
Published in: Journal of Functional Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0802.0646
Methods involving semicontinuity and convergence; relaxation (49J45) Measures and integrals in product spaces (28A35)
Related Items (29)
On a problem of optimal transport under marginal martingale constraints ⋮ Canonical supermartingale couplings ⋮ The directional optimal transport ⋮ A saddle-point approach to the Monge-Kantorovich optimal transport problem ⋮ Stability of entropic optimal transport and Schrödinger bridges ⋮ Optimal transport from Lebesgue to Poisson ⋮ A non‐linear monotonicity principle and applications to Schrödinger‐type problems ⋮ Optimal measure transportation with respect to non-traditional costs ⋮ A strong duality principle for equivalence couplings and total variation ⋮ Dynamic generation of scenario trees ⋮ Unnamed Item ⋮ Martingale Benamou-Brenier: a probabilistic perspective ⋮ Optimal mass transport and symmetric representations of their cost functions ⋮ The multistochastic Monge-Kantorovich problem ⋮ On Sudakov’s type decomposition of transference plans with norm costs ⋮ Duality for Borel measurable cost functions ⋮ On optimality of \(c\)-cyclically monotone transference plans ⋮ $C$-cyclical monotonicity as a sufficient criterion for optimality in the multimarginal Monge–Kantorovich problem ⋮ Multiperiod martingale transport ⋮ A Rockafellar-type theorem for non-traditional costs ⋮ On the equality of values in the Monge and Kantorovich problems ⋮ Kantorovich problems with a parameter and density constraints ⋮ Multivariate comonotonicity ⋮ On multistochastic Monge-Kantorovich problem, bitwise operations, and fractals ⋮ Shadow martingales -- a stochastic mass transport approach to the peacock problem ⋮ Existence, duality, and cyclical monotonicity for weak transport costs ⋮ Cyclical monotonicity and the ergodic theorem ⋮ Tree approximation for discrete time stochastic processes: a process distance approach ⋮ Optimal transport and Skorokhod embedding
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Hoeffding-Fréchet bounds and cyclic monotone relations
- Convex analysis and measurable multifunctions
- The geometry of optimal transportation
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- On \(c\)-optimal random variables
- On the sufficiency of \(c\)-cyclical monotonicity for optimality of transport plans
- Characterization of the subdifferentials of convex functions
- Duality theorems for marginal problems
- Characterization of optimal transport plans for the Monge-Kantorovich problem
- Foundations of Modern Probability
- Optimal Transport
This page was built for publication: Optimal and better transport plans