Linear programming brings marital bliss

A stable matching is an assignment of n men to n women so that no two people prefer each other to their respective spouses. This paper describes the convex hull of the incidence vectors of stable matchings. With this description, one may solve the optimal stable marriage problem as a linear program.

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 8; no. 3; pp. 147 - 153
Main Author Vande Vate, John H.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.06.1989
Elsevier
Subjects
Applied sciences
Exact sciences and technology
linear programming
Mathematical programming
Operational research and scientific management
Operational research. Management science
stable matching
linear programming
stable matching
Linear programming
Optimization
Mathematical programming
Online AccessGet full text

Cover

More Information
Summary:A stable matching is an assignment of n men to n women so that no two people prefer each other to their respective spouses. This paper describes the convex hull of the incidence vectors of stable matchings. With this description, one may solve the optimal stable marriage problem as a linear program.
ISSN:0167-6377
1872-7468
DOI:10.1016/0167-6377(89)90041-2