How hard is it to satisfy (almost) all roommates?

by   Jiehua Chen, et al.

The classical Stable Roommates problem (which is a non-bipartite generalization of the well-known Stable Marriage problem) asks whether there is a stable matching for a given set of agents (i.e. a partitioning of the agents into disjoint pairs such that no two agents induce a blocking pair). Herein, each agent has a preference list denoting who it prefers to have as a partner, and two agents are blocking if they prefer to be with each other rather than with their assigned partners. Since stable matchings may not be unique, we study an NP-hard optimization variant of Stable Roommates, called Egalitarian Stable Roommates, which seeks to find a stable matching with a minimum egalitarian cost γ, (i.e. the sum of the dissatisfaction of the matched agents is minimum). The dissatisfaction of an agent is the number of agents that this agent prefers over its partner if it is matched; otherwise it is the length of its preference list. We also study almost stable matchings, called Min-Block-Pairs Stable Roommates, which seeks to find a matching with a minimum number β of blocking pairs. Our main result is that Egalitarian Stable Roommates parameterized by γ is fixed-parameter tractable while Min-Block-Pairs Stable Roommates parameterized by β is W[1]-hard.


page 1

page 2

page 3

page 4


On the (Parameterized) Complexity of Almost Stable Marriage

In the Stable Marriage problem. when the preference lists are complete, ...

The stable marriage problem with ties and restricted edges

In the stable marriage problem, a set of men and a set of women are give...

Euclidean 3D Stable Roommates is NP-hard

We establish NP-completeness for the Euclidean 3D Stable Roommates probl...

Stable Matchings with Flexible Quotas

We consider the problem of assigning agents to programs in the presence ...

On (Coalitional) Exchange-Stable Matching

We study (coalitional) exchange stability, which Alcalde [Economic Desig...

A General Framework for Stable Roommates Problems using Answer Set Programming

The Stable Roommates problem (SR) is characterized by the preferences of...

On the diameter of the polytope of the stable marriage with ties

The stable marriage problem with ties is a well-studied and interesting ...

Please sign up or login with your details

Forgot password? Click here to reset