DeepAI AI Chat
Log In Sign Up

Improved Paths to Stability for the Stable Marriage Problem

by   Vijay Kumar Garg, et al.
The University of Texas at Austin

The stable marriage problem requires one to find a marriage with no blocking pair. Given a matching that is not stable, Roth and Vande Vate have shown that there exists a sequence of matchings that leads to a stable matching in which each successive matching is obtained by satisfying a blocking pair. The sequence produced by Roth and Vande Vate's algorithm is of length O(n^3) where n is the number of men (and women). In this paper, we present an algorithm that achieves stability in a sequence of matchings of length O(n^2). We also give an efficient algorithm to find the stable matching closest to the given initial matching under an appropriate distance function between matchings.


page 1

page 2

page 3

page 4


On (Coalitional) Exchange-Stable Matching

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

Stable Noncrossing Matchings

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

Mechanism Design for Stable Matching with Contracts in a Dynamic Manufacturing-as-a-Service (MaaS) Marketplace

Two-sided manufacturing-as-a-service (MaaS) marketplaces connect clients...

Euclidean 3D Stable Roommates is NP-hard

We establish NP-completeness for the Euclidean 3D Stable Roommates probl...

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

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

The Complexity of Interactively Learning a Stable Matching by Trial and Error

In a stable matching setting, we consider a query model that allows for ...

Daycare Matching in Japan: Transfers and Siblings

In this paper, we study a daycare matching problem in Japan and report t...