LP based approach to optimal stable matchings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A fixed-point approach to stable matchings and some applications
Mathematics of Operations Research
On a generalization of the stable roommates problem
ACM Transactions on Algorithms (TALG)
Many-to-One Stable Matching: Geometry and Fairness
Mathematics of Operations Research
Efficient algorithms for generalized Stable Marriage and Roommates problems
Theoretical Computer Science
Journal of Discrete Algorithms
Information Processing Letters
Two's company, three's a crowd: stable family and threesome roommates problems
ESA'07 Proceedings of the 15th annual European conference on Algorithms
The stable roommates problem with choice functions
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
SIAM Journal on Discrete Mathematics
Two hardness results for core stability in hedonic coalition formation games
Discrete Applied Mathematics
| Hi-index | 0.00 |
It is shown that Stable Matching problems are the same as problems about stable configurations of X-networks. Consequences include easy proofs of old theorems, a new simple algorithm for finding a stable matching, an understanding of the difference between Stable Marriage and Stable Roommates, NP-completeness of Three-party Stable Marriage, CC-completeness of several Stable Matching problems, and a fast parallel reduction from the Stable Marriage problem to the Assignment problem.