On the approximability of the stable marriage problem with one-sided ties

05/14/2018
by   Felix Bauckholt, et al.
0

The classical stable marriage problem asks for a matching between a set of men and a set of women with no blocking pairs, which are pairs formed by a man and a woman who would both prefer switching from their current status to be paired up together. When both men and women have strict preferences over the opposite group, all stable matchings have the same cardinality, and the famous Gale-Shapley algorithm can be used to find one. Differently, if we allow ties in the preference lists, finding a stable matching of maximum cardinality is an NP-hard problem, already when the ties are one-sided, that is, they appear only in the preferences of one group. For this reason, many researchers have focused on developing approximation algorithm for this problem. In this paper, we give a refined analysis of an approximation algorithm given by Huang and Telikepalli (IPCO14) for the stable marriage problem with one-sided ties, which shows an improved 13/9 -approximation factor for the problem. Interestingly, our analysis is tight.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/14/2018

On the approximability of the stable matching problem with ties of size two

The stable matching problem is one of the central problems of algorithmi...
research
05/11/2020

On the Approximability of the Stable Matching Problem with Ties of Constant Size up to the Integrality Gap

Finding a stable matching is one of the central problems in algorithmic ...
research
05/11/2020

Approximating Stable Matchings with Ties of Bounded Size

Finding a stable matching is one of the central problems in algorithmic ...
research
04/24/2018

Robust and Approximately Stable Marriages under Partial Information

We study the stable marriage problem in the partial information setting ...
research
03/05/2018

Two-sided popular matchings in bipartite graphs with forbidden/forced elements and weights

Two-sided popular matchings in bipartite graphs are a well-known general...
research
07/07/2021

An Approximation Algorithm for Maximum Stable Matching with Ties and Constraints

We present a polynomial-time 3/2-approximation algorithm for the problem...
research
07/14/2022

Efficient One Sided Kolmogorov Approximation

We present an efficient algorithm that, given a discrete random variable...

Please sign up or login with your details

Forgot password? Click here to reset