Stable Many-to-Many Matchings with Contracts
25 Pages Posted: 28 Sep 2008 Last revised: 14 May 2009
Date Written: September 25, 2008
Abstract
We consider several notions of setwise stability for many-to-many matching markets with contracts and provide an analysis of the relations between the resulting sets of stable allocations for general, substitutable, and strongly substitutable preferences. Apart from obtaining "set inclusion results" on all three domains, we introduce weak setwise stability as a new stability concept and prove that for substitutable preferences the set of pairwise stable matchings is nonempty and coincides with the set of weakly setwise stable matchings. For strongly substitutable preferences the set of pairwise stable matchings coincides with the set of setwise stable matchings.
Keywords: Many-to-Many Matching, Matching with Contracts, Pairwise Stability, Setwise Stability
JEL Classification: C62, C78, D78, J41
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
Recommended Papers
-
By Alvin E. Roth and Elliott Peranson
-
By Alvin E. Roth, Tayfun Sonmez, ...
-
By Alvin E. Roth, Tayfun Sonmez, ...
-
House Allocation with Existing Tenants: An Equivalence
By Tayfun Sonmez and M. Utku Ünver
-
A Theory of Stability in Many-to-Many Matching Markets
By Federico Echenique and Jorge Oviedo
-
Changing the Boston School Choice Mechanism
By Atila Abdulkadiroglu, Parag A. Pathak, ...
-
Course Bidding at Business Schools
By Tayfun Sonmez and M. Utku Ünver
-
Manna from Heaven or Forty Years in the Desert: Optimal Allocation Without Transfer Payments
-
Stability and Nash Implementation in Matching Markets with Couples