Courtship and linear programming

This paper demonstrates that the celebrated Gale-Shapley algorithm for obtaining stable matchings in stable marriage problems is essentially an application of the dual simplex method.

Saved in:
Bibliographic Details
Published in:Linear algebra and its applications 1995-02, Vol.216, p.111-124
Main Authors: Abeledo, Hernán G., Rothblum, Uriel G.
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper demonstrates that the celebrated Gale-Shapley algorithm for obtaining stable matchings in stable marriage problems is essentially an application of the dual simplex method.
ISSN:0024-3795
1873-1856
DOI:10.1016/0024-3795(93)00122-G