An algorithm to compute the full set of many-to-many stable matchings. (Q1431789): Difference between revisions

@@ Property / cites work @@
+On preferences over subsets and the lattice structure of stable matchings
+Normal rank
@@ Property / cites work @@
+Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
+Normal rank
@@ Property / cites work @@
+The Lattice Structure of the Set of Stable Matchings with Multiple Partners
+Normal rank
@@ Property / cites work @@
+College Admissions and the Stability of Marriage
@@ Property / cites work: College Admissions and the Stability of Marriage / rank @@
+Normal rank
@@ Property / cites work @@
+Q3995616
@@ Property / cites work: Q3995616 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Stable Marriages
@@ Property / cites work: The Complexity of Counting Stable Marriages / rank @@
+Normal rank
@@ Property / cites work @@
+Job Matching, Coalition Formation, and Gross Substitutes
+Normal rank
@@ Property / cites work @@
+On the lattice structure of the set of stable matchings for a many-to-one model<sup>∗</sup>
+Normal rank
@@ Property / cites work @@
+Stability and Polarization of Interests in Job Matching
+Normal rank
@@ Property / cites work @@
+Conflict and Coincidence of Interest in Job Matching: Some New Results and Open Questions
+Normal rank
@@ Property / cites work @@
+Q3999327
@@ Property / cites work: Q3999327 / rank @@
+Normal rank
@@ Property / cites work @@
+Three remarks on the many-to-many stable matching problem
+Normal rank
@@ Property / cites work @@
+The lattice structure of the set of stable outcomes of the multiple partners assignment game
+Normal rank