Stable Many-to-Many Matchings with Contracts

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 stable sets and pairwise stable sets for general, substitutable, and strongly substitutable preferences. Apart from obtaining “set inclusion results'''' on all three domains, we 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. We also show that Roth’s (1984) stability coincides with pairwise stability for substitutable preferences.