a Université de Brest, Laboratoire de Mathématiques, UMR 6205, 6 Av. Le Gorgeu, BP 809, 29238 Brest cedex 3, France b Université Paris Dauphine, CEREMADE, Place du Maréchal De Lattre De Tassigny, 75775 Paris cedex 16, France
Abstract:
We consider the Monge transportation problem when the cost is the squared geodesic distance around a convex obstacle. We show that there exists at least one—and in general infinitely many—optimal transport maps.