作者: Endre Boros , Vladimir Gurvich , Steven Jaslar , Daniel Krasner
DOI: 10.1016/J.DISC.2004.08.012
关键词:
摘要: We consider generalizations of the Gale-Shapley (Amer. Math. Monthly 69 (1962) 9) Stable Marriage Problem to three-sided families. Alkan (Math. Social Sci. 16 (1988) 207) gave an example which shows that in this case stable matchings do not always exist. Here we provide a simpler demonstrating fact. Danilov (NATO Advanced Research Workshop on Mathematical Theory Allocation Discrete Resources: Equilibria, Matching, Mechanisms, Sabanci University, Istanbul, Turkey, 16-19 December 2001; 46(2) (2003) 145) proved exist for special certain acyclic preferences and he raised problem another involving cyclic preferences. show answer is still negative by constructing system with lexicographically no matching exists. Finally, also possible s-sided families, s>3.