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.