A polynomial-time algorithm to find von Neumann-Morgenstern stable matchings in marriage games (Q1959733): Difference between revisions

@@ Property / cites work @@
+The exchange-stable marriage problem
@@ Property / cites work: The exchange-stable marriage problem / rank @@
+Normal rank
@@ Property / cites work @@
+Von Neumann-Morgenstern stable sets in matching problems
+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 @@
+Some remarks on the stable matching problem
@@ Property / cites work: Some remarks on the stable matching problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3995616
@@ Property / cites work: Q3995616 / rank @@
+Normal rank
@@ Property / cites work @@
+An Equilibrium-Point Interpretation of Stable Sets and a Proposed Alternative Definition
+Normal rank
@@ Property / cites work @@
+Stable marriage assignment for unequal sets
@@ Property / cites work: Stable marriage assignment for unequal sets / rank @@
+Normal rank
@@ Property / cites work @@
+A lattice fixed-point theorem with constraints
@@ Property / cites work: A lattice fixed-point theorem with constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Subsolutions and the Supercore of Cooperative Games
+Normal rank
@@ Property / cites work @@
+Q3999327
@@ Property / cites work: Q3999327 / rank @@
+Normal rank
@@ Property / cites work @@
+On cores and indivisibility
@@ Property / cites work: On cores and indivisibility / rank @@
+Normal rank
@@ Property / cites work @@
+Q5821521
@@ Property / cites work: Q5821521 / rank @@
+Normal rank