Existence of stable matchings in some three-sided systems

VI Danilov - Mathematical Social Sciences, 2003 - Elsevier
… We give here some restrictions on preferences sufficient for existence of stable matching
in multi-sided systems. … We assert that μ is a stable three-sided matching. Indeed,
suppose that there exists a blocking triple (m, w, c). This means that (w, c)≻ m μ(m)=(w′, c′)
and similarly for the woman w and the child c. Since …
Showing the best result for this search. See all results