Characterization of Super-stable Matchings

by   Changyong Hu, et al.

An instance of the super-stable matching problem with incomplete lists and ties is an undirected bipartite graph G = (A ∪ B, E), with an adjacency list being a linearly ordered list of ties. Ties are subsets of vertices equally good for a given vertex. An edge (x,y) ∈ E \ M is a blocking edge for a matching M if by getting matched to each other neither of the vertices x and y would become worse off. Thus, there is no disadvantage if the two vertices would like to match up. A matching M is super-stable if there is no blocking edge with respect to M. It has previously been shown that super-stable matchings form a distributive lattice and the number of super-stable matchings can be exponential in the number of vertices. We give two compact representations of size O(m) that can be used to construct all super-stable matchings, where m denotes the number of edges in the graph. The construction of the second representation takes O(mn) time, where n denotes the number of vertices in the graph, and gives an explicit rotation poset similar to the rotation poset in the classical stable marriage problem. We also give a polyhedral characterisation of the set of all super-stable matchings and prove that the super-stable matching polytope is integral, thus solving an open problem stated in the book by Gusfield and Irving .


page 1

page 2

page 3

page 4


Saturating stable matchings

A bipartite graph consists of two disjoint vertex sets, where vertices o...

On the (Parameterized) Complexity of Almost Stable Marriage

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

A Matroid Generalization of the Super-Stable Matching Problem

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

The Graphs of Stably Matchable Pairs

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

Maximum-utility popular matchings with bounded instability

In a graph where vertices have preferences over their neighbors, a match...

Preference Swaps for the Stable Matching Problem

An instance I of the Stable Matching Problem (SMP) is given by a biparti...

Stable Noncrossing Matchings

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

Please sign up or login with your details

Forgot password? Click here to reset