DeepAI AI Chat
Log In Sign Up

A Matroid Generalization of the Super-Stable Matching Problem

by   Naoyuki Kamiyama, et al.

A super-stable matching, which was introduced by Irving, is a solution concept in a variant of the stable matching problem in which the preferences may contain ties. Irving proposed a polynomial-time algorithm for the problem of finding a super-stable matching if a super-stable matching exists. In this paper, we consider a matroid generalization of a super-stable matching. We call our generalization of a super-stable matching a super-stable common independent set. This can be considered as a generalization of the matroid generalization of a stable matching for strict preferences proposed by Fleiner. We propose a polynomial-time algorithm for the problem of finding a super-stable common independent set if a super-stable common independent set exists.


page 1

page 2

page 3

page 4


Strongly Stable Matchings under Matroid Constraints

We consider a many-to-one variant of the stable matching problem. More c...

A Natural Generalization of Stable Matching Solved via New Insights into Ideal Cuts

We study a natural generalization of stable matching to the maximum weig...

Adapting Stable Matchings to Forced and Forbidden Pairs

We introduce the problem of adapting a stable matching to forced and for...

A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas

In the Hospital Residents problem with lower and upper quotas (HR-Q^U_L)...

Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching

The Stable Marriage problem (SM), solved by the famous deferred acceptan...

Characterization of Super-stable Matchings

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

Matchings under Preferences: Strength of Stability and Trade-offs

We propose two solution concepts for matchings under preferences: robust...