Matching for teams
From MaRDI portal
Publication:847810
DOI10.1007/s00199-008-0415-zzbMath1183.91112OpenAlexW2027755860MaRDI QIDQ847810
Guillaume Carlier, Ivar Ekeland
Publication date: 19 February 2010
Published in: Economic Theory (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.fr/handle/123456789/6728
Convex programming (90C25) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Microeconomic theory (price theory and economic markets) (91B24) Matching models (91B68)
Related Items (39)
THE MULTI-MARGINAL OPTIMAL PARTIAL TRANSPORT PROBLEM ⋮ An optimal matching problem with constraints ⋮ Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces ⋮ Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness ⋮ Wasserstein Barycenters Are NP-Hard to Compute ⋮ Measure-Valued Spline Curves: An Optimal Transport Viewpoint ⋮ Discrete Wasserstein barycenters: optimal transport for discrete data ⋮ On the Linear Convergence of the Multimarginal Sinkhorn Algorithm ⋮ The geometry of multi-marginal Skorokhod embedding ⋮ Multi-marginal optimal transport and multi-agent matching problems: uniqueness and structure of solutions ⋮ Variational problems involving unequal dimensional optimal transport ⋮ Polynomial-time algorithms for multimarginal optimal transport problems with structure ⋮ A family of pairwise multi-marginal optimal transports that define a generalized metric ⋮ Monge solutions and uniqueness in multi-marginal optimal transport via graph theory ⋮ Online team formation under different synergies ⋮ Unbalanced multi-marginal optimal transport ⋮ Generalized Wasserstein barycenters between probability measures living on different subspaces ⋮ On the Uniqueness and Numerical Approximations for a Matching Problem ⋮ Robust matching for teams ⋮ Limit theorems for entropic optimal transport maps and Sinkhorn divergence ⋮ Simple approximative algorithms for free-support Wasserstein barycenters ⋮ An optimal transport approach for the Schrödinger bridge problem and convergence of Sinkhorn algorithm ⋮ Gradient projection methods for the $n$-coupling problem ⋮ Elements of Statistical Inference in 2-Wasserstein Space ⋮ On the local structure of optimal measures in the multi-marginal optimal transportation problem ⋮ Wasserstein barycenters over Riemannian manifolds ⋮ Understanding the topology and the geometry of the space of persistence diagrams via optimal partial transport ⋮ Tomographic reconstruction from a few views: a multi-marginal optimal transport approach ⋮ Variational methods for tomographic reconstruction with few views ⋮ Unnamed Item ⋮ Geometry of Kantorovich polytopes and support of optimizers for repulsive multi-marginal optimal transport on finite state spaces ⋮ Barycenters for the Hellinger--Kantorovich Distance Over $\mathbb{R}^d$ ⋮ Unnamed Item ⋮ Equilibrium in quality markets, beyond the transferable case ⋮ Interpolating between matching and hedonic pricing models ⋮ On c-cyclical monotonicity for optimal transport problem with Coulomb cost ⋮ A Simple Counterexample to the Monge Ansatz in Multimarginal Optimal Transport, Convex Geometry of the Set of Kantorovich Plans, and the Frenkel--Kontorova Model ⋮ Multi-Marginal Optimal Transportation Problem for Cyclic Costs ⋮ Iterative Bregman Projections for Regularized Transportation Problems
Cites Work
- Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- An optimal matching problem
- Polar factorization and monotone rearrangement of vector‐valued functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Matching for teams
