Cyclical monotonicity and the ergodic theorem

DOI10.1017/etds.2013.75zbMath1355.37010OpenAlexW2124143150MaRDI QIDQ5262239

Mathias Beiglböck

Publication date: 13 July 2015

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8793a221ad9ff84f79d03e47e26ed3a7a9c06654

zbMATH Keywords

ergodic theoremtransport plans

Mathematics Subject Classification ID

Ergodic theorems, spectral theory, Markov operators (37A30)

Related Items (5)

Remarks on the Monge-Kantorovich problem in the discrete setting ⋮ $C$-cyclical monotonicity as a sufficient criterion for optimality in the multimarginal Monge–Kantorovich problem ⋮ Applications of weak transport theory ⋮ Cyclically monotone non-optimal N-marginal transport plans and Smirnov-type decompositions for N-flows ⋮ Stability of martingale optimal transport and weak optimal transport

Cites Work

• On optimality of \(c\)-cyclically monotone transference plans
• Optimal and better transport plans
• On Hoeffding-Fréchet bounds and cyclic monotone relations
• The geometry of optimal transportation
• Optimal transportation and applications. Lectures given at the C. I. M. E. summer school, Martina Franca, Italy, September 2--8, 2001
• On \(c\)-optimal random variables
• On the sufficiency of \(c\)-cyclical monotonicity for optimality of transport plans
• Characterization of the subdifferentials of convex functions
• Characterization of optimal transport plans for the Monge-Kantorovich problem
• Optimal Transport

This page was built for publication: Cyclical monotonicity and the ergodic theorem