UNIVERSITY of GLASGOW

Computing at Glasgow University
 
Paper ID: 8771

Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
Irving,R.W. Manlove,D.F.

Publication Type: Journal
Appeared in: Journal of Combinatorial Optimization, volume 16, number 3
Page Numbers : 279-292
Publisher: Springer
Year: 2008
ISBN/ISSN:

URL: This publication is available at this URL.

Abstract:

When ties and incomplete preference lists are permitted in the Stable Marriage and Hospitals/Residents problems, stable matchings can have different sizes. The problem of finding a maximum cardinality stable matching in this context is known to be NP-hard, even under very severe restrictions on the number, size and position of ties. In this paper, we describe polynomial-time 5/3-approximation algorithms for variants of these problems in which ties are on one side only and at the end of the preference lists. The particular variant is motivated by important applications in large scale centralised matching schemes.

Keywords: Stable matching; Weak stability; NP-hard problems; Approximation algorithms


PDF Bibtex entry Endnote XML