Linear programming brings marital bliss

Authors:
John H. Vande Vate
Affiliations:
School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA
Venue:
Operations Research Letters
Year:
1989

Citing 6
Cited 1

The complexity of counting stable marriages

SIAM Journal on Computing
An efficient algorithm for the “optimal” stable marriage

Journal of the ACM (JACM)
Every finite distributive lattice is a set of stable matchings for a small stable marriage instance

Journal of Combinatorial Theory Series A
The stable marriage problem

Communications of the ACM
Introductory Combinatorics

Introductory Combinatorics
Stable matching with preferences derived from a psychological model

Operations Research Letters

Note: Blockers and antiblockers of stable matchings

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.