The stable marriage problem with ties and restricted edges

07/24/2019
by   Ágnes Cseh, et al.
0

In the stable marriage problem, a set of men and a set of women are given, each of whom has a strictly ordered preference list over the acceptable agents in the opposite class. A matching is called stable if it is not blocked by any pair of agents, who mutually prefer each other to their respective partner. Ties in the preferences allow for three different definitions for a stable matching: weak, strong and super-stability. Besides this, acceptable pairs in the instance can be restricted in their ability of blocking a matching or being part of it, which again generates three categories of restrictions on acceptable pairs. Forced pairs must be in a stable matching, forbidden pairs must not appear in it, and lastly, free pairs cannot block any matching. Our computational complexity study targets the existence of a stable solution for each of the three stability definitions, in the presence of each of the three types of restricted pairs. We solve all cases that were still open. As a byproduct, we also derive that the maximum size weakly stable matching problem is hard even in very dense graphs, which may be of independent interest.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

07/13/2017

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

The classical Stable Roommates problem (which is a non-bipartite general...
03/06/2019

Stable Noncrossing Matchings

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

Pairwise preferences in the stable marriage problem

We study the classical, two-sided stable marriage problem under pairwise...
05/12/2021

On (Coalitional) Exchange-Stable Matching

We study (coalitional) exchange stability, which Alcalde [Economic Desig...
01/23/2020

Strongly Stable and Maximum Weakly Stable Noncrossing Matchings

In IWOCA 2019, Ruangwises and Itoh introduced stable noncrossing matchin...
04/24/2018

Robust and Approximately Stable Marriages under Partial Information

We study the stable marriage problem in the partial information setting ...
02/15/2019

Matchings under Preferences: Strength of Stability and Trade-offs

We propose two solution concepts for matchings under preferences: robust...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.