Stable matchings and linear programming

This paper continues the work of Abeledo and Rothblum, who study nonbipartite stable matching problems from a polyhedral perspective. We establish here additional properties of fractional stable matchings and use linear programming to obtain an alternative polynomial algorithm for solving stable mat...

Full description

Saved in:
Bibliographic Details
Published in:Linear algebra and its applications 1996-09, Vol.245, p.321-333
Main Authors: Abeledo, Hernán, Blum, Yosef
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 continues the work of Abeledo and Rothblum, who study nonbipartite stable matching problems from a polyhedral perspective. We establish here additional properties of fractional stable matchings and use linear programming to obtain an alternative polynomial algorithm for solving stable matching problems.
ISSN:0024-3795
1873-1856
DOI:10.1016/0024-3795(95)00052-6