2009
DOI: 10.1016/j.jmateco.2009.03.007
|View full text |Cite
|
Sign up to set email alerts
|

Stable many-to-many matchings with contracts

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 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
49
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 88 publications
(50 citation statements)
references
References 17 publications
1
49
0
Order By: Relevance
“…6 Intuitively, this condition means that there are no two contracts x, z ∈ X which are sometimes "complements" in the sense that the availability of z makes x more attractive. 7 A number of alternative stability concepts are available for many-to-many matching settings (Blair, 1988;Echenique and Oviedo, 2006;Klaus and Walzl, 2009). In general, the choice of solution concept is somewhat immaterial for the present exercise: Embedding results analogous to Theorem 2 hold so long as the stability concept under consideration for the case of matching with salaries corresponds to that considered for the case of matching with contracts.…”
Section: Matching With Salariesmentioning
confidence: 99%
See 2 more Smart Citations
“…6 Intuitively, this condition means that there are no two contracts x, z ∈ X which are sometimes "complements" in the sense that the availability of z makes x more attractive. 7 A number of alternative stability concepts are available for many-to-many matching settings (Blair, 1988;Echenique and Oviedo, 2006;Klaus and Walzl, 2009). In general, the choice of solution concept is somewhat immaterial for the present exercise: Embedding results analogous to Theorem 2 hold so long as the stability concept under consideration for the case of matching with salaries corresponds to that considered for the case of matching with contracts.…”
Section: Matching With Salariesmentioning
confidence: 99%
“…12 In modeling many-to-many matching with contracts, unitarity is an added assumption; the model of Klaus and Walzl (2009) imposes it, while that of Hatfield and Kominers (2010) does not. Hatfield and Kojima (2010) show (in their Theorem 3) that in unitary models of matching with contracts, substitutability implies the following Pareto separability condition similar to that of Roth (1984).…”
Section: Definition 1 a Model Of Matching With Contracts Is Unitarymentioning
confidence: 99%
See 1 more Smart Citation
“…Our notion differs from the strong substitutes condition of Echenique and Ovideo [6], [7] and of Klaus and Walzl [14] because our definition is purely set-theoretical: we do not use any preference relations. In fact, we could introduce preference relations leading to our choice map.…”
Section: Existence Of Stable Schedule Matchingsmentioning
confidence: 99%
“…This, together with a special preference relation yields a choice map for which the theory applies. Many papers have followed by adapting the theory to more realistic and more complex problems; we cite Hatfield and Milgrom [13], Echenique and Ovideo [6], [7], Klaus and Walzl [14] among the most recent ones: many others figure in their references.…”
Section: Introductionmentioning
confidence: 99%