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.
No takes yet. Share an insight, caveat, or question.
Ashok Subramanian (1994) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: