Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem

References

• Alkan A., Alkan A., Aliprantis C. D., Yianellis N. C. On the properties of stable many-to-many matchings under responsive preferences. Studies in Economic Theory (1999) (Springer-Verlag, Berlin) 29–40Crossref, Google Scholar
• Baïou M., Balinski M. L. Many-to-many matching: Stable polyandrous polygamy (or polygamous polyandry). Discrete Appl. Math. (2000a) 101(3):1–12Crossref, Google Scholar
• Baïou M., Balinski M. L. The stable admissions polytope. Math. Programming (2000b) 87(3):427–439Crossref, Google Scholar
• Balinski M., Ratier G. Of stable marriages and graphs, and strategy and polytopes. SIAM Rev. (1997) 39(4):575–604Crossref, Google Scholar
• Bansal V., Agrawal A., Malhotra V. S. Polynomial time algorithm for an optimal stable assignment with multiple partners. Theoretical Comput. Sci. (2007) 379(3):317–328Crossref, Google Scholar
• Blair C. The lattice structure of the set of stable matchings with multiple partners. Math. Oper. Res. (1988) 13(4):619–628Link, Google Scholar
• Cheng C. Understanding the generalized median stable matchings. Algorithmica (2010) 58(1):34–51Crossref, Google Scholar
• Echenique F., Oviedo J. A theory of stability in many-to-many matching markets. Theoretical Econom. (2006) 1(2):233–273Google Scholar
• Eirinakis P., Magos D., Mourtos I., Miliotis P. Hyperarc consistency for the stable admissions problem. Proc. 19th IEEE Internat. Conf. Tools Aritificial Intelligence (ICTAI'07) (2007) (IEEE Computer Society, Washington, DC) 239–242Crossref, Google Scholar
• Fleiner T. On the stable b-matching polytope. Math. Soc. Sci. (2003) 46(2):149–158Crossref, Google Scholar
• Gabow H. N. Scaling algorithms for network problems. J. Comput. System Sci. (1985) 31(2):148–168Crossref, Google Scholar
• Gale D. The two-sided matching problem. Origin, development and current issues. Internat. Game Theory Rev. (2001) 3(2–3):237–252Crossref, Google Scholar
• Gale D., Shapley L. S. College admissions and the stability of marriage. Amer. Math. Monthly (1962) 69(1):9–15Crossref, Google Scholar
• Gent I. P., Prosser P. An empirical study of the stable marriage problem with ties and incomplete lists. Proc. ECAI'02 (2002) (IOS Press, Amsterdam) 141–145Google Scholar
• Gent I. P., Irving R. W., Manlove D. F., Prosser P., Smith B. M., Walsh T. A constraint programming approach to the stable marriage problem. Proc. 7th Internat. Conf. Principles Practice Constraint Programming, Vol. 2239 (2001) (Springer, Berlin) 225–239Lecture Notes in Computer ScienceCrossref, Google Scholar
• Goldberg A. V., Rao S. Beyond the flow decomposition barrier. J. ACM (1998) 45(5):783–797Crossref, Google Scholar
• Gusfield D. Three fast algorithms for four problems in stable marriage. SIAM J. Comput. (1987) 16(1):111–128Crossref, Google Scholar
• Gusfield D., Irving R. W.The Stable Marriage Problem: Structure and Algorithms (1989) (MIT Press, Cambridge, MA) Google Scholar
• Hooker J.Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction (2000) (John Wiley & Sons, New York) Crossref, Google Scholar
• ILOG ILOG Solver 6.1 Callable Library. (2005) . IBM, Armonk, NYGoogle Scholar
• Kelso A. S., Crawford V. P. Job matching, coalition formation and gross substitutes. Econometrica (1982) 50(6):1483–1504Crossref, Google Scholar
• Knuth D. E.Mariages stables et leurs relations avec d'autres problèmes combinatoires (1976) (Les Presses de l'Université de Montréal, Montréal) Google Scholar
• Manlove D. F., O'Malley G. Modelling and solving the stable marriage problem using constraint programming. (2005) . Technical Report TR-2005-192, Department of Computing Science, University of Glasgow, Glasgow, ScotlandGoogle Scholar
• Manlove D. F., O'Malley G., Prosser P., Unsworth C., Van Hentenryck P., Wolsey L. A constraint programming approach to the hospitals/residents problem. Proc. 4th Internat. Conf. Integration Artificial Intelligence Oper. Res. Techniques Constraint Programming Combinatorial Optim. Problems (CPAIOR'07), Vol. 4510 (2007) (Springer, Berlin) 155–170Lecture Notes in Computer ScienceCrossref, Google Scholar
• Manlove D. F., Irving R. W., Iwama K., Miyazaki S., Morita Y. Hard variants of stable marriage. Theoretical Comput. Sci. (2002) 276(1–2):261–279Crossref, Google Scholar
• Martínez R., Massó J., Neme A., Oviedo J. An algorithm to compute the full set of many-to-many stable matchings. Math. Soc. Sci. (2004) 47(2):187–210Crossref, Google Scholar
• McVitie D. G., Wilson L. B. The stable marriage problem. Comm. ACM (1971) 14(7):486–490Crossref, Google Scholar
• Picard J.-C. Maximal closure of a graph and applications to combinatorial problems. Management Sci. (1976) 22(11):1268–1272Link, Google Scholar
• Régin J.-C. Generalized arc-consistency for global cardinality constraint. Proc. AAAI'96 (1996) (AAAI Press, Menlo Park, CA) 209–215Google Scholar
• Roth A. E., Sotomayor M. A. O.Two-Sided Matching: A Study in Game Theoretic Modelling and Analysis, Vol. 18 (1990) (Cambridge University Press, Cambridge, UK) Economic Society MonographsCrossref, Google Scholar
• Sotomayor M. A. O. Three remarks on the many-to-many stable matching problem. Math. Soc. Sci. (1999) 38(1):55–70Crossref, Google Scholar
• Unsworth C. A specialized constraint approach for stable matching problems. (2008) . Ph.D. thesis, University of Glasgow, Glasgow, ScotlandGoogle Scholar