Log In Sign Up

On the (Parameterized) Complexity of Almost Stable Marriage

by   Sushmita Gupta, et al.

In the Stable Marriage problem. when the preference lists are complete, all agents of the smaller side can be matched. However, this need not be true when preference lists are incomplete. In most real-life situations, where agents participate in the matching market voluntarily and submit their preferences, it is natural to assume that each agent wants to be matched to someone in his/her preference list as opposed to being unmatched. In light of the Rural Hospital Theorem, we have to relax the "no blocking pair" condition for stable matchings in order to match more agents. In this paper, we study the question of matching more agents with fewest possible blocking edges. In particular, we find a matching whose size exceeds that of stable matching in the graph by at least t and has at most k blocking edges. We study this question in the realm of parameterized complexity with respect to several natural parameters, k,t,d, where d is the maximum length of a preference list. Unfortunately, the problem remains intractable even for the combined parameter k+t+d. Thus, we extend our study to the local search variant of this problem, in which we search for a matching that not only fulfills each of the above conditions but is "closest", in terms of its symmetric difference to the given stable matching, and obtain an FPT algorithm.


page 1

page 2

page 3

page 4


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

The classical Stable Roommates problem (which is a non-bipartite general...

On (Coalitional) Exchange-Stable Matching

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

Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas

To mitigate the imbalance in the number of assignees in the Hospitals/Re...

Stable Noncrossing Matchings

Given a set of n men represented by n points lying on a line, and n wome...

Daycare Matching in Japan: Transfers and Siblings

In this paper, we study a daycare matching problem in Japan and report t...

On popularity-based random matching markets

Stable matching in a community consisting of N men and N women is a clas...

Characterization of Super-stable Matchings

An instance of the super-stable matching problem with incomplete lists a...