The stable fixtures problem—A many-to-many extension of stable roommates
Authors:
- 1 October 2007
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 155 (16) , 2118-2129
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The Stable Roommates Problem with TiesJournal of Algorithms, 2002
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)Discrete Applied Mathematics, 2000
- Stable Marriage and Its Relation to Other Combinatorial Problems1996
- Stable marriage and indifferenceDiscrete Applied Mathematics, 1994
- NP-complete stable matching problemsJournal of Algorithms, 1990
- Lower Bounds for the Stable Marriage Problem and Its VariantsSIAM Journal on Computing, 1990
- The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable AssignmentsSIAM Journal on Computing, 1988
- An efficient algorithm for the “stable roommates” problemJournal of Algorithms, 1985
- College Admissions and the Stability of MarriageThe American Mathematical Monthly, 1962