An 8/5-approximation algorithm for a hard variant of stable marriage

Authors:
Robert W. Irving;David F. Manlove
Affiliations:
Department of Computing Science, University of Glasgow, Glasgow, UK;Department of Computing Science, University of Glasgow, Glasgow, UK
Venue:
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Year:
2007

Citing 7
Cited 0

The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms
Hard variants of stable marriage

Theoretical Computer Science
Matching Medical Students to Pairs of Hospitals: A New Variation on a Well-Known Theme

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Approximability results for stable marriage problems with ties

Theoretical Computer Science
Randomized approximation of the stable marriage problem

Theoretical Computer Science - Special papers from: COCOON 2003
A 1.875: approximation algorithm for the stable marriage problem

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A (2 - c1/√N)-approximation algorithm for the stable marriage problem

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

When ties and incomplete preference lists are permitted in the Stable Marriage problem, stable matchings can have different sizes. The problem of finding a maximum cardinality stable matching in this context is known to be NP-hard, even under very severe restrictions on the number, size and position of ties. In this paper, we describe a polynomial-time 8/5 -approximation algorithm for a variant in which ties are on one side only and at the end of the preference lists. The particular variant is motivated by important applications in large scale centralized matching schemes.