Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness

DOI10.1007/s00199-009-0455-zzbMath1183.91056OpenAlexW2046916388MaRDI QIDQ847819

Lars P. Nesheim, Pierre-André Chiappori, Robert J. McCann

Publication date: 19 February 2010

Published in: Economic Theory (Search for Journal in Brave)

Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/14672/

zbMATH Keywords

matchingoptimal transportationtwist conditionMonge-Kantorovichhedonic price equilibriumSpence-Mirrlees condition

Mathematics Subject Classification ID

Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Microeconomic theory (price theory and economic markets) (91B24) Matching models (91B68)

Related Items

Matching in closed-form: equilibrium, identification, and comparative statics ⋮ A characterization for solutions of the Monge-Kantorovich mass transport problem ⋮ An optimal matching problem with constraints ⋮ On the importance of uniform sharing rules for efficient matching ⋮ Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces ⋮ Matching for teams ⋮ ON THE CONVERGENCE RATE OF POTENTIALS OF BRENIER MAPS ⋮ Mini-workshop: The \(p\)-Laplacian operator and applications. Abstracts from the workshop held February 10--16, 2013. ⋮ Discrete Wasserstein barycenters: optimal transport for discrete data ⋮ On the Linear Convergence of the Multimarginal Sinkhorn Algorithm ⋮ Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal Optimal Transport Problems ⋮ Inefficient sorting under output sharing ⋮ A glimpse into the differential topology and geometry of optimal transport ⋮ Multi-marginal optimal transport and multi-agent matching problems: uniqueness and structure of solutions ⋮ Competitive search equilibrium with multidimensional heterogeneity and two-sided ex-ante investments ⋮ Variational problems involving unequal dimensional optimal transport ⋮ Polynomial-time algorithms for multimarginal optimal transport problems with structure ⋮ Competitive equilibrium with search frictions: a general equilibrium approach ⋮ POSITIVE SKILL CLUSTERING IN ROLE‐ASSIGNMENT MATCHING MODELS ⋮ The boundary method for semi-discrete optimal transport partitions and Wasserstein distance computation ⋮ Monge solutions and uniqueness in multi-marginal optimal transport via graph theory ⋮ A planning problem combining calculus of variations and optimal transport ⋮ A geometric Laplace method ⋮ On the Uniqueness and Numerical Approximations for a Matching Problem ⋮ Robust matching for teams ⋮ Limit theorems for entropic optimal transport maps and Sinkhorn divergence ⋮ Solutions to multi-marginal optimal transport problems concentrated on several graphs ⋮ An optimal transport approach for the Schrödinger bridge problem and convergence of Sinkhorn algorithm ⋮ Entropy methods for identifying hedonic models ⋮ Optimal mass transport and symmetric representations of their cost functions ⋮ Problèmes de transport multi-marginal de Monge-Kantorovich : une caractérisation des solutions ⋮ On the local structure of optimal measures in the multi-marginal optimal transportation problem ⋮ Academic wages and pyramid schemes: a mathematical model ⋮ The intrinsic dynamics of optimal transport ⋮ On optimal partitions, individual values and cooperative games: does a wiser agent always produce a higher value? ⋮ Testable implications of transferable utility ⋮ HIERARCHICAL ORGANIZATION AND PERFORMANCE INEQUALITY: EVIDENCE FROM PROFESSIONAL CYCLING ⋮ Continuity, curvature, and the general covariance of optimal transportation ⋮ Multi-player, multi-prize, imperfectly discriminating contests ⋮ Geometry of Kantorovich polytopes and support of optimizers for repulsive multi-marginal optimal transport on finite state spaces ⋮ Optimal Transport and Cournot-Nash Equilibria ⋮ 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 ⋮ Iterative Bregman Projections for Regularized Transportation Problems ⋮ Local stability constraints ⋮ Optimal matching problems with costs given by Finsler distances ⋮ Optimal transportation, topology and uniqueness ⋮ Pointwise Estimates and Regularity in Geometric Optics and Other Generated Jacobian Equations ⋮ Invariance properties of the Monge-Kantorovich mass transport problem ⋮ Towards the smoothness of optimal maps on Riemannian submersions and Riemannian products (of round spheres in particular)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dual least action problem for an ideal, incompressible fluid
• Matching for teams
• Existence, uniqueness and efficiency of equilibrium in hedonic markets with multidimensional types
• Free boundaries in optimal transport and Monge-Ampère obstacle problems
• Perfect competition in the continuous assignment model
• On Hoeffding-Fréchet bounds and cyclic monotone relations
• The nonatomic assignment model
• The geometry of optimal transportation
• Supports of doubly stochastic measures
• Existence and uniqueness of monotone measure-preserving maps
• Regularity of potential functions of the optimal transportation problem
• The assignment game. I: The core
• Nonparametric Identification and Estimation of Nonadditive Hedonic Models
• Duality theorems for marginal problems
• An optimal matching problem
• Exact solutions to the transportation problem on the line
• Optimal maps for the multidimensional Monge-Kantorovich problem
• Shape recognition via Wasserstein distance
• Precise solutions of the one-dimensional Monge-Kantorovich problem
• Optimal Transport