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

Irving, R.W. and Manlove, D.F. (2007) An 8/5 approximation algorithm for a hard variant of stable marriage. In: Proceedings of COCOON 2007, 13th Annual International Computing and Combinatorics Conference, Banff, Canada, 16-19 July 2007, pp. 548-558. (doi: 10.1007/978-3-540-73545-8_53)

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 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. This variant is motivated by important applications in large scale centralized matching schemes.

• Item Type: Conference Proceedings
• Additional Information: A later version of this paper is available via the Related URL link.
• Keywords: stable matching; approximation algorithm
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Manlove, Professor David
• Authors: Irving, R.W., and Manlove, D.F.
• Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
• College/School: College of Science and Engineering > School of Computing Science
• Research Group: Formal Analysis, Theory and Algorithms
• Journal Name: Lecture Notes in Computer Science
• Publisher: Springer Verlag
• ISSN: 0302-9743
• Copyright Holders: Copyright © 2007 Springer Verlag
• First Published: First published in the Lecture Notes in Computer Science 4598:548-558
• Publisher Policy: Reproduced in accordance with the copyright policy of the publisher.

Related URLs

• Other