Refined Inequalities for Stable Marriage
Constraints
Erratum: The Stable Allocation (or Ordinal Transportation) Problem
Mathematics of Operations Research
Student admissions and faculty recruitment
Theoretical Computer Science - Discrete applied problems, florilegium for E. Goles
On the independent dominating set polytope
European Journal of Combinatorics
Many-to-One Stable Matching: Geometry and Fairness
Mathematics of Operations Research
A network visualization of stable matching in the stable marriage problem
Artificial Life and Robotics
Mapping problems to dynamical systems for robustness and adaptability: the case of matching problems
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
A dynamical model of stable marriage problem based on Lotka Volterra model
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
A diagrammatic classification in a combinatorial problem: the case of the stable marriage problem
Artificial Life and Robotics
Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem
INFORMS Journal on Computing
| Hi-index | 0.00 |
This expository paper develops the principal known results (and some new ones) on the stable matchings of marriage games in the language of directed graphs. This both unifies and simplifies the presentation and renders it more symmetric. In addition, it yields a new algorithm and a new proof for the existence of stable matchings, new proofs for many known facts, and some new results (notably concerning players' strategies and the properties of the stable matching polytope).