It is proved that if 0 < λ ≤ f(x) ≤ Λ for x ∈ Ω, where Ω ⊂ R is a bounded convex domain, and f is L-Dini continuous on Ω, then there exist infinitely many biLipschitz maps F : Ω → R such that detDF (x) = f(x) for a.e. x ∈ Ω. Moreover, these mappings can be chosen to have convex potentials. We relate our result to a classical theorem by H. M. Reimann; however, the emphasis is on the novel use of...

We show a stability estimate for the degenerate complex Monge-Ampère operator that generalizes a result of Ko lodziej [11]. In particular, we obtain the optimal stability exponent and also treat the case when the right hand side is a general Borel measure satisfying certain regularity conditions. Moreover our result holds for functions plurisubharmonic with respect to a big form generalizing th...

We survey old and new regularity theory for the Monge-Ampère equation, show its connection to optimal transportation, and describe the regularity properties of a general class of Monge-Ampère type equations arising in that context.

2 Formulation of the mass transport problems 4 2.1 The original Monge-Kantorovich problem . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Guessing a good dual to the Monge-Kantorovich problem . . . . . . . . . . . . . 6 2.3 Properties of ”Extreme points of C” . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.4 Existence of a minimizer . . . . . . . . . . . . . . . . . . . . . . . . . . . ...

Recently a Dynamic-Monge-Kantorovich formulation of the PDE-based -optimal transport problem was presented. The model considers diffusion equation enforcing balance transported masses with time-varying conductivity that evolves proportionally to flux. In this paper we present an extension time derivative grows as power-law flux exponent ?>0. A sub-linear growth (0<?<1) penalizes intensity and p...

We consider an Hamilton-Jacobi equation of the form H(x,Du) = 0 x ∈ Ω ⊂ R , (1) where H(x, p) is assumed Borel measurable and quasi-convex in p. The notion of Monge solution, introduced by Newcomb and Su, is adapted to this setting making use of suitable metric devices. We establish the comparison principle for Monge sub and supersolution, existence and uniqueness for equation (1) coupled with ...

We prove the existence of solutions for the Monge minimization problem, addressed in a metric measure space (X, d,m) enjoying the Riemannian curvature-dimension condition RCD∗(K,N), with N < ∞. For the first marginal measure, we assume that μ0 ≪ m. As a corollary, we obtain that the Monge problem and its relaxed version, the Monge-Kantorovich problem, attain the same minimal value. Moreover we ...

We continue the research on the eeects of Monge structures in the area of combinatorial optimization. We show that three optimization problems become easy if the underlying cost matrix fulllls the Monge property: (A) The balanced max{cut problem, (B) the problem of computing minimum weight binary k-matchings and (C) the computation of longest paths in bipartite, edge-weighted graphs. In all thr...

In this paper, we introduce the 1− K robotic-cell scheduling problem, whose solution can be reduced to solving a TSP on specially structured permuted Monge matrices, we call b-decomposable matrices. We also review a number of other scheduling problems which all reduce to solving TSP-s on permuted Monge matrices. We present the important insight that the TSP on b-decomposable matrices can be sol...

The Monge mass transfer problem, as proposed by Monge in 1781, is to move points from one mass distribution to another so that a cost functional is minimized among all measure preserving maps. The existence of an optimal mapping was proved by Sudakov in 1979, using probability theory. A proof based on partial differential equations was recently found by Evans andGangbo. In this paperwegive amor...