Cyclical monotonicity and the ergodic theorem
From MaRDI portal
Publication:5262239
Recommendations
- On the sufficiency of \(c\)-cyclical monotonicity for optimality of transport plans
- On optimality of \(c\)-cyclically monotone transference plans
- Characterization of optimal transport plans for the Monge-Kantorovich problem
- The \(L^\infty\) optimal transport: infinite cyclical monotonicity and the existence of optimal transport maps
- \(C\)-cyclical monotonicity as a sufficient criterion for optimality in the multimarginal Monge-Kantorovich problem
Cites work
- Characterization of optimal transport plans for the Monge-Kantorovich problem
- Characterization of the subdifferentials of convex functions
- On Hoeffding-Fréchet bounds and cyclic monotone relations
- On \(c\)-optimal random variables
- On optimality of \(c\)-cyclically monotone transference plans
- On the sufficiency of \(c\)-cyclical monotonicity for optimality of transport plans
- Optimal Transport
- Optimal and better transport plans
- Optimal transportation and applications. Lectures given at the C. I. M. E. summer school, Martina Franca, Italy, September 2--8, 2001
- The geometry of optimal transportation
Cited in
(6)- \(C\)-cyclical monotonicity as a sufficient criterion for optimality in the multimarginal Monge-Kantorovich problem
- Attracting theorems for cyclic sets and impermanence
- Cyclically monotone non-optimal N-marginal transport plans and Smirnov-type decompositions for N-flows
- Applications of weak transport theory
- Remarks on the Monge-Kantorovich problem in the discrete setting
- Stability of martingale optimal transport and weak optimal transport
This page was built for publication: Cyclical monotonicity and the ergodic theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262239)
