STABLE MATCHINGS AND LINEAR-PROGRAMMING

Authors
Citation
H. Abeledo et Y. Blum, STABLE MATCHINGS AND LINEAR-PROGRAMMING, Linear algebra and its applications, 245, 1996, pp. 321-333
Citations number
15
Categorie Soggetti
Mathematics,Mathematics
ISSN journal
00243795
Volume
245
Year of publication
1996
Pages
321 - 333
Database
ISI
SICI code
0024-3795(1996)245:<321:SMAL>2.0.ZU;2-3
Abstract
This paper continues the work of Abeledo and Rothblum, who study nonbi partite stable matching problems from a polyhedral perspective. We est ablish here additional properties of fractional stable matchings and u se linear programming to obtain an alternative polynomial algorithm fo r solving stable matching problems.