An optimal matching problem

DOI10.1051/COCV:2004034zbMATH Open1106.49054arXivmath/0308206OpenAlexW1978398078MaRDI QIDQ3365387FDOQ3365387

Authors: Ivar Ekeland 

Publication date: 23 January 2006

Published in: ESAIM: Control, Optimisation and Calculus of Variations (Search for Journal in Brave)

Abstract: Given two measured spaces (X,dx), (Y,dy) and a third space Z, given two functions u(x,z) and v(x,z), we study the problem of finding two maps s from X to Z and t from Y to Z such that the images s(dx) and t(dy) coincide, and the integral of u(x,s(x))dx+v(y,t(y))dy is maximal. We give condition on u and v for which there is a unique solution.

Full work available at URL: https://arxiv.org/abs/math/0308206

Recommendations

• An Optimal Matching Problem for the Euclidean Distance
• The geometry of optimal transportation
• scientific article; zbMATH DE number 1257374
• Optimality conditions and exact solutions of the two-dimensional Monge-Kantorovich problem
• On optimal matching measures for matching problems related to the Euclidean distance.

zbMATH Keywords

optimal transportationmeasure-preserving maps

Mathematics Subject Classification ID

Variational problems in a geometric measure-theoretic setting (49Q20) Exact enumeration problems, generating functions (05A15) Paths and cycles (05C38)

Cites Work

• The geometry of optimal transportation
• Polar factorization and monotone rearrangement of vector‐valued functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (26)

• Interpolating between matching and hedonic pricing models
• Special issue: Optimal transportation, equilibrium, and applications to economics
• Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness
• An optimal hostage rescue problem.
• Existence, uniqueness and efficiency of equilibrium in hedonic markets with multidimensional types
• Robust risk management via multi-marginal optimal transport
• Optimal pricing for optimal transport
• Optimal matching problems with costs given by Finsler distances
• Robust matching for teams
• \({\mathcal{W}}_\infty \)-transport with discrete target as a combinatorial matching problem
• On optimal matching measures for matching problems related to the Euclidean distance.
• Optimal partition of a large labor force into working pairs
• Optimal mass transport and symmetric representations of their cost functions
• Title not available (Why is that?)
• Limit theorems for entropic optimal transport maps and Sinkhorn divergence
• Mini-workshop: The \(p\)-Laplacian operator and applications. Abstracts from the workshop held February 10--16, 2013.
• Multi-marginal optimal transport and multi-agent matching problems: uniqueness and structure of solutions
• Pointwise estimates and regularity in geometric optics and other generated Jacobian equations
• Matching for teams
• An optimal matching problem with constraints
• On the uniqueness and numerical approximations for a matching problem
• Matchings in metric spaces, the dual problem and calibrations modulo 2
• A planning problem combining calculus of variations and optimal transport
• A perfect match condition for point-set matching problems using the optimal mass transport approach
• The pre-marital investment game
• Variational problems involving unequal dimensional optimal transport

This page was built for publication: An optimal matching problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3365387)