Results 1  10
of
105
The geometry of optimal transportation
 Acta Math
, 1996
"... A classical problem of transporting mass due to Monge and Kantorovich is solved. Given measures µ and ν on R d, we find the measurepreserving map y(x) between them with minimal cost — where cost is measured against h(x − y) withhstrictly convex, or a strictly concave function of x − y. This map i ..."
Abstract

Cited by 143 (30 self)
 Add to MetaCart
A classical problem of transporting mass due to Monge and Kantorovich is solved. Given measures µ and ν on R d, we find the measurepreserving map y(x) between them with minimal cost — where cost is measured against h(x − y) withhstrictly convex, or a strictly concave function of x − y. This map is unique: it is characterized by the formula y(x) =x−(∇h) −1 (∇ψ(x)) and geometrical restrictions on ψ. Connections with mathematical economics, numerical computations, and the MongeAmpère equation are sketched. ∗ Both authors gratefully acknowledge the support provided by postdoctoral fellowships: WG at
Differential equations methods for the MongeKantorovich mass transfer problem
 Mem. Amer. Math. Soc
, 1999
"... We demonstrate that a solution to the classical Monge–Kantorovich problem of optimally rearranging the measure µ + = f + dx onto µ − = f − dy can be constructed by studying the pLaplacian equation −div(Dup  p−2 Dup) = f + − f − in the limit as p → ∞. The idea is to show up → u, where u satisfie ..."
Abstract

Cited by 86 (8 self)
 Add to MetaCart
We demonstrate that a solution to the classical Monge–Kantorovich problem of optimally rearranging the measure µ + = f + dx onto µ − = f − dy can be constructed by studying the pLaplacian equation −div(Dup  p−2 Dup) = f + − f − in the limit as p → ∞. The idea is to show up → u, where u satisfies Du  ≤ 1, −div(aDu) = f + − f − for some density a ≥ 0, and then to build a flow by solving an ODE involving a, Du, f + and f −. Contents 1.
Perspectives of Monge Properties in Optimization
, 1995
"... An m × n matrix C is called Monge matrix if c ij + c rs c is + c rj for all 1 i ! r m, 1 j ! s n. In this paper we present a survey on Monge matrices and related Monge properties and their role in combinatorial optimization. Specifically, we deal with the following three main topics: (i) funda ..."
Abstract

Cited by 53 (3 self)
 Add to MetaCart
An m × n matrix C is called Monge matrix if c ij + c rs c is + c rj for all 1 i ! r m, 1 j ! s n. In this paper we present a survey on Monge matrices and related Monge properties and their role in combinatorial optimization. Specifically, we deal with the following three main topics: (i) fundamental combinatorial properties of Monge structures, (ii) applications of Monge properties to optimization problems and (iii) recognition of Monge properties.
OPTIMAL PATHS RELATED TO TRANSPORT PROBLEMS
, 2003
"... In transport problems of Monge’s types, the total cost of a transport map is usually an integral of some function of the distance, such as x − y  p. In many real applications, the actual cost may naturally be determined by a transport path. For shipping two items to one location, a “Y shaped” path ..."
Abstract

Cited by 43 (13 self)
 Add to MetaCart
In transport problems of Monge’s types, the total cost of a transport map is usually an integral of some function of the distance, such as x − y  p. In many real applications, the actual cost may naturally be determined by a transport path. For shipping two items to one location, a “Y shaped” path may be preferable to a “V shaped ” path. Here, we show that any probability measure can be transported to another probability measure through a general optimal transport path, which is given by a vector measure in our setting. Moreover, we define a new distance on the space of probability measures which in fact metrizies the weak * topology of measures. Under this distance, the space of probability measures becomes a length space. Relations as well as related problems about transport paths and transport plans are also discussed in the end.
Optimal mass transportation and Mather theory
 JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY
, 2005
"... We study the Monge transportation problem when the cost is the action associated to a Lagrangian function on a compact manifold. We show that the transportation can be interpolated by a Lipschitz lamination. We describe several direct variational problems the minimizers of which are these Lipschitz ..."
Abstract

Cited by 33 (4 self)
 Add to MetaCart
We study the Monge transportation problem when the cost is the action associated to a Lagrangian function on a compact manifold. We show that the transportation can be interpolated by a Lipschitz lamination. We describe several direct variational problems the minimizers of which are these Lipschitz laminations. We prove the existence of an optimal transport map when the transported measure is absolutely continuous. We explain the relations with Mather’s minimal measures.
Continuity, curvature, and the general covariance of optimal transportation
"... Abstract. Let M and ¯ M be ndimensional manifolds equipped with suitable Borel probability measures ρ and ¯ρ. For subdomains M and ¯ M of Rn, Ma, Trudinger & Wang gave sufficient conditions on a transportation cost c ∈ C4 (M × ¯ M) to guarantee smoothness of the optimal map pushing ρ forward to ¯ρ ..."
Abstract

Cited by 33 (13 self)
 Add to MetaCart
Abstract. Let M and ¯ M be ndimensional manifolds equipped with suitable Borel probability measures ρ and ¯ρ. For subdomains M and ¯ M of Rn, Ma, Trudinger & Wang gave sufficient conditions on a transportation cost c ∈ C4 (M × ¯ M) to guarantee smoothness of the optimal map pushing ρ forward to ¯ρ; the necessity of these conditions was deduced by Loeper. The present manuscript shows the form of these conditions to be largely dictated by the covariance of the question; it expresses them via nonnegativity of the sectional curvature of certain nullplanes in a novel but natural pseudoRiemannian geometry which the cost c induces on the product space M × ¯ M. We also explore some connections between optimal transportation and spacelike Lagrangian submanifolds in symplectic geometry. Using the pseudoRiemannian structure, we extend Ma, Trudinger and Wang’s conditions to transportation costs on differentiable manifolds, and provide a direct elementary proof of a maximum principal characterizing it due to Loeper, relaxing his hypotheses even for subdomains M and ¯ M of Rn. This maximum principle plays a key role in Loeper’s Hölder continuity theory of optimal maps. Our proof allows his theory to be made logically independent of all earlier works, and sets the stage for extending it to new global settings, such as general submersions and tensor products of the specific Riemannian manifolds he considered. 1.
2009): “Set Identification in Models with Multiple Equilibria,” Working Paper, Université de Montreal
"... Abstract. We propose a computationally feasible way of deriving the identified set of parameter values in models with multiple equilibria, with particular emphasis on oligopoly entry models. This is achieved through an equivalence result between the existence of an equilibrium selection mechanism co ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
Abstract. We propose a computationally feasible way of deriving the identified set of parameter values in models with multiple equilibria, with particular emphasis on oligopoly entry models. This is achieved through an equivalence result between the existence of an equilibrium selection mechanism compatible with the observed data and a set of inequalities, and through an appeal to efficient linear programming techniques.
BOUNDARY REGULARITY OF OPTIMAL TRANSPORT PATHS
"... The optimal transport problem aims at finding an optimal way to transport a given probability measure into another. In contrast to the wellknown MongeKantorovich problem, the ramified optimal transportation problem aims at modeling a treetyped branching transport network by an optimal transport ..."
Abstract

Cited by 17 (10 self)
 Add to MetaCart
The optimal transport problem aims at finding an optimal way to transport a given probability measure into another. In contrast to the wellknown MongeKantorovich problem, the ramified optimal transportation problem aims at modeling a treetyped branching transport network by an optimal transport path between two given probability measures. An essential feature of such a transport path is to favor group transportation in a large amount. In previous works, the author has studied the existence, and regularity of an optimal transport path away from its boundary points. In particular, an optimal transport path of finite cost is an 1dimensional rectifiable current. In this article, we study the regularity of such an optimal transport path nearby its boundary. Motivated from observing the vein structure of a tree leaf, we show that each superlevel set of an optimal transport path is locally supported on a biLipschitz graph, which is a finite union of biLipschitz curves.