DeepAI AI Chat
Log In Sign Up

Stable Noncrossing Matchings

by   Suthee Ruangwises, et al.
Tokyo Institute of Technology

Given a set of n men represented by n points lying on a line, and n women represented by n points lying on another parallel line, with each person having a list that ranks some people of opposite gender as his/her acceptable partners in strict order of preference. In this problem, we want to match people of opposite genders to satisfy people's preferences as well as making the edges not crossing one another geometrically. A noncrossing blocking pair of a matching M is a pair (m,w) of a man and a woman such that they are not matched with each other but prefer each other to their own partners in M, and the segment (m,w) does not cross any edge in M. A weakly stable noncrossing matching (WSNM) is a noncrossing matching that does not contain any noncrossing blocking pair. In this paper, we prove the existence of a WSNM in any instance by developing an O(n^2) algorithm to find one in a given instance.


page 1

page 2

page 3

page 4


On the (Parameterized) Complexity of Almost Stable Marriage

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

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

Improved Paths to Stability for the Stable Marriage Problem

The stable marriage problem requires one to find a marriage with no bloc...

On the diameter of the polytope of the stable marriage with ties

The stable marriage problem with ties is a well-studied and interesting ...

On (Coalitional) Exchange-Stable Matching

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

Characterization of Super-stable Matchings

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

Maximum-utility popular matchings with bounded instability

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