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 N^{1-epsilon}, where N is the instance size, unless P=NP.

University of Glasgow, University Avenue, Glasgow G12 8QQ, United Kingdom
tel: +44 (0)141 330 2000
The University of Glasgow is a registered Scottish charity: registration number SC004401About Enlighten