Please use this identifier to cite or link to this item:
Cseh, Ágnes
Irving, Robert W.
Manlove, David F.
Year of Publication: 
Series/Report no.: 
IEHAS Discussion Papers MT-DP - 2017/26
We consider two variants of the classical Stable Roommates problem with Incomplete (but strictly ordered) preference lists (SRI) that are degree constrained, i.e., preference lists are of bounded length. The first variant, egal d-SRI, involves finding an egalitarian stable matching in solvable instances of SRI with preference lists of length at most d. We show that this problem is NP-hard even if d = 3. On the positive side we give a 2d+3 / 7-approximation algorithm for d {3, 4, 5} which improves on the known bound of 2 for the unbounded preference list case. In the second variant of SRI, called d-SRTI, preference lists can include ties and are of length at most d. We show that the problem of deciding whether an instance of d-SRTI admits a stable matching is NP-complete even if d = 3. We also consider the "most stable" version of this problem and prove a strong inapproximability bound for the d = 3 case. However for d = 2 we show that the latter problem can be solved in polynomial time.
stable matching
bounded length preference lists
approximation algorithm
Document Type: 
Working Paper
Social Media Mentions:

Files in This Item:
710.38 kB

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.