DeepAI AI Chat
Log In Sign Up

Adapting Stable Matchings to Forced and Forbidden Pairs

by   Niclas Boehmer, et al.

We introduce the problem of adapting a stable matching to forced and forbidden pairs. Specifically, given a stable matching M_1, a set Q of forced pairs, and a set P of forbidden pairs, we want to find a stable matching that includes all pairs from Q, no pair from P, and that is as close as possible to M_1. We study this problem in four classical stable matching settings: Stable Roommates (with Ties) and Stable Marriage (with Ties). As our main contribution, we develop an algorithmic technique to "propagate" changes through a stable matching. This technique is at the core of our polynomial-time algorithm for adapting Stable Roommates matchings to forced pairs. In contrast to this, we show that the same problem for forbidden pairs is NP-hard. However, our propagation technique allows for a fixed-parameter tractable algorithm with respect to the number of forbidden pairs when both forced and forbidden pairs are present. Moreover, we establish strong intractability results when preferences contain ties.


page 1

page 2

page 3

page 4


A Matroid Generalization of the Super-Stable Matching Problem

A super-stable matching, which was introduced by Irving, is a solution c...

Finding Robust Solutions to Stable Marriage

We study the notion of robustness in stable matching problems. We first ...

The Graphs of Stably Matchable Pairs

We study the graphs formed from instances of the stable matching problem...

Adapting Stable Matchings to Evolving Preferences

Adaptivity to changing environments and constraints is key to success in...

Minimal Envy Matchings in the Hospitals/Residents Problem with Lower Quotas

In the Hospitals/Residents problem, every hospital has an upper quota th...

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...

Finding Stable Matchings that are Robust to Errors in the Input

Given an instance A of stable matching, let B be the instance that resul...