“Almost Stable” Matchings in the Roommates Problem

  • David J. Abraham
  • Péter Biró
  • David F. Manlove
Conference paper

DOI: 10.1007/11671411_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3879)
Cite this paper as:
Abraham D.J., Biró P., Manlove D.F. (2006) “Almost Stable” Matchings in the Roommates Problem. In: Erlebach T., Persinao G. (eds) Approximation and Online Algorithms. WAOA 2005. Lecture Notes in Computer Science, vol 3879. Springer, Berlin, Heidelberg

Abstract

An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, i.e. admits the fewest number of blocking pairs. In this paper we prove that, given an sr instance with n agents, in which all preference lists are complete, the problem of finding a matching with the fewest number of blocking pairs is NP-hard and not approximable within \(n^{\frac{1}{2}-\varepsilon}\), for any ε> 0, unless P=NP. If the preference lists contain ties, we improve this result to n1 − ε. Also, we show that, given an integer K and an sr instance I in which all preference lists are complete, the problem of deciding whether I admits a matching with exactly K blocking pairs is NP-complete. By contrast, if K is constant, we give a polynomial-time algorithm that finds a matching with at most (or exactly) K blocking pairs, or reports that no such matching exists. Finally, we give upper and lower bounds for the minimum number of blocking pairs over all matchings in terms of some properties of a stable partition, given an sr instance I.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • David J. Abraham
    • 1
  • Péter Biró
    • 2
  • David F. Manlove
    • 3
  1. 1.Computer Science DepartmentCarnegie-Mellon UniversityUSA
  2. 2.Department of Algebra, and Department of Computer Science and Information TheoryBudapest University of Technology and EconomicsHungary
  3. 3.Department of Computing ScienceUniversity of GlasgowUK

Personalised recommendations