UNIVERSITY of GLASGOW

Computing at Glasgow University
 
Paper ID: 5471

Stable marriage with incomplete lists and ties
Iwama,K. Manlove,D.F. Miyakazi,S. Morita,Y.

Publication Type: Conference Proceedings
Appeared in: Proceedings of ICALP'99: The 26th International Colloquium on Automata, Languages and Programming, volume 1644 of Lecture Notes in Computer Science
Page Numbers : 443-452
Publisher: Springer Verlag
Year: 1999
ISBN/ISSN: 3-540-66224-3

URL: This publication is available at this URL.

Note: (c) Springer-Verlag


Abstract:

The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and several relaxations have been proposed, including the following two common ones: one is to allow an incomplete list, i.e., a man is permitted to accept only a subset of the women and vice versa. The other is to allow a preference list including ties. Fortunately, it is known that both relaxed problems can still be solved in polynomial time. In this paper, we show that the situation changes substantially if we allow both relaxations (incomplete lists and ties) at the same time: the problem not only becomes NP-hard, but also the optimal cost version has no approximation algorithm achieving the approximation ratio of N1-\epsilon, where N is the instance size, unless P=NP.


PDF Bibtex entry Endnote XML