Two-sided matching with spatially differentiated agents

Tilman Klumpp ()

Journal of Mathematical Economics, 2009, vol. 45, issue 5-6, 376-390

Abstract: We consider the problem of assigning sellers and buyers into stable matches. The agents are located along a line and the match surplus function is decreasing in the distance between partners. We investigate the structure of stable assignments under both non-transferable utility (NTU) and transferable utility (TU). If the surplus function is sufficiently convex, the TU-stable assignments are a subset of the NTU-stable assignments. Furthermore, if trade is restricted to uni-directional flows the unique TU-stable assignment coincides with the unique NTU-stable assignment for every convex surplus function. We also examine the graph-theoretic representation of stable assignments and show that the graph structure can be exploited to compute surplus shares in TU-stable assignments.

Keywords: Spatial; heterogeneity; Bilateral; exchange; Two-sided; matching; Assignment; game; Stable; marriage; problem (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304-4068(09)00022-6
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:mateco:v:45:y:2009:i:5-6:p:376-390

Access Statistics for this article

Journal of Mathematical Economics is currently edited by Atsushi (A.) Kajii

More articles in Journal of Mathematical Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().