Abstract
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among the other two groups. The goal is to organize them into family units, so that no three of them have incentive to desert their assigned family members to join in a new family. A similar problem, called the threesome roommates problem, assumes that a group of persons, each with their preferences among the combinations of two others, are to be partitioned into triples. Similarly, the goal is to make sure that no three persons want to break up with their assigned roommates.
Ng and Hirschberg were the first to investigate these two problems. In their formulation, each participant provides a strictly-ordered list of all combinations. They proved that under this scheme, both problems are NP-complete. Their paper reviewers pointed out that their reduction exploits inconsistent preference lists and they wonder whether these two problems remain NP-complete if preferences are required to be consistent. We answer in the affirmative.
In order to give these two problems a broader outlook, we also consider the possibility that participants can express indifference, on the condition that the preference consistency has to be maintained. As an example, we propose a scheme in which all participants submit two (or just one in the roommates case) lists ranking the other two groups separately. The order of the combinations is decided by the sum of their ordinal numbers. Combinations are tied when the sums are equal. By introducing indifference, a hierarchy of stabilities can be defined. We prove that all stability definitions lead to NP-completeness for existence of a stable matching.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boros, E., Gurvich, V., Jaslar, S., Krasner, D.: Stable matchings in three-sided systems with cyclic preferences. Discrete Mathematics 289(1-3), 1–10 (2004)
Danilov, V.I.: Existence of stable matchings in some three-sided systems. Mathematical Social Science 46(2), 145–148 (2003)
Gale, D., Shapley, L.: College admissions and the stability of marriage. American Mathematical Monthly 69(1), 9–15 (1962)
Garey, M., Johnson, D.: Computers and Intractablility. Freeman, San Francisco (1979)
Huang, C.-C.: Two’s company, three’s a crowd: Stable family and threesome roommates problems. Technical Report TR2007-598, Computer Science Department, Dartmouth College (2007)
Irving, R.: An efficient algorithm for the stable room-mates problem. Journal of Algorithms 6, 577–595 (1985)
Irving, R.: Stable marriage and indifference. Discrete Applied Mathematics 48, 261–272 (1994)
Karp, R.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103 (1972)
Knuth, D.: Mariages stables et leurs relations avec d’autre problèmes combinatoires. Les Presses de l’université de Montréal (1976)
Ng, C., Hirschberg, D.: Three-dimensional stable matching problems. SIAM Journal on Discrete Mathematics 4(2), 245–252 (1991)
Subramanian, A.: A new approach to stable matching problems. SIAM Journal on Computing 23(4), 671–700 (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, CC. (2007). Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems. In: Arge, L., Hoffmann, M., Welzl, E. (eds) Algorithms – ESA 2007. ESA 2007. Lecture Notes in Computer Science, vol 4698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75520-3_50
Download citation
DOI: https://doi.org/10.1007/978-3-540-75520-3_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75519-7
Online ISBN: 978-3-540-75520-3
eBook Packages: Computer ScienceComputer Science (R0)