Skip to main content
Article thumbnail
Location of Repository

An algorithm for a super-stable roommates problem

By T. Fleiner, R.W. Irving and D.F. Manlove

Abstract

In this paper, we describe an efficient algorithm that decides if a stable matching exists for a generalized stable roommates problem, where, instead of linear preferences, agents have partial preference orders on potential partners. Furthermore, we may forbid certain partnerships, that is, we are looking for a matching such that none of the matched pairs is forbidden, and yet, no blocking pair (forbidden or not) exists.\ud \ud To solve the above problem, we generalize the first algorithm for the ordinary stable roommates problem

Topics: QA
Publisher: Elsevier
Year: 2011
OAI identifier: oai:eprints.gla.ac.uk:57323
Provided by: Enlighten

Suggested articles

Citations

  1. (1991). A necessary and sufficient condition for the existence of a complete stable matching, doi
  2. (1985). An efficient algorithm for the “stable roommates” problem, doi
  3. (1962). College admissions and stability of marriage, doi
  4. (2007). Efficient algorithms for generalised stable marriage and roommates problems, doi
  5. (1990). NP-complete stable matching problems, doi
  6. (2003). On a lemma of Scarf, doi
  7. (2003). The stable marriage problem with restricted pairs, doi
  8. (2002). The stable roommates problem with ties, doi
  9. (2005). The study of stable marriage problems with ties, doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.