An efficient algorithm for the “stable roommates” problem
type: Item
instance of: scholarly article
title: An efficient algorithm for the “stable roommates” problem
zbMATH Open document ID: 0581.05001
DOI: 10.1016/0196-6774(85)90033-1
author: Robert W. Irving
published in: Journal of Algorithms
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68R99
zbMATH DE Number: 3929009
zbMATH Keywords: stable marriage problem
zbMATH Keywords: stable roommates problem
zbMATH Keywords: stable matching
Wikidata QID: Q57311970
MaRDI profile type: Publication
full work available at URL: 0196-6774(85)90033-1
OpenAlex ID: W2068574579
DBLP publication ID: journals/jal/Irving85
Recommended article: An algorithm for a super-stable roommates problem
Recommended article: The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
Recommended article: Efficient algorithms for generalized stable marriage and roommates problems
Recommended article: A maximum stable matching for the roommates problem
Recommended article: Approximation and Online Algorithms
Recommended article: On a generalization of the stable roommates problem
Recommended article: The complexity of approximately counting stable roommate assignments
Recommended article: The ``stable roommates'' problem with random preferences
Recommended article: On the existence of stable roommate matchings
description: scientific article