A maximum stable matching for the roommates problem
type: Item
instance of: scholarly article
title: A maximum stable matching for the roommates problem
zbMATH Open document ID: 0711.68051
DOI: 10.1007/BF01933211
author: Jimmy J. M. Tan
published in: BIT
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 4170096
zbMATH Keywords: stable roommates problem
zbMATH Keywords: stable matching
zbMATH Keywords: maximum stable matching
MaRDI profile type: Publication
cites work: College Admissions and the Stability of Marriage
cites work: The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
cites work: Q3995616
cites work: An efficient algorithm for the “stable roommates” problem
cites work: A necessary and sufficient condition for the existence of a complete stable matching
full work available at URL: https://doi.org/10.1007/bf01933211
OpenAlex ID: W1968154277
Recommended article: Approximation and Online Algorithms
Recommended article: On the existence of stable roommate matchings
Recommended article: An efficient algorithm for the “stable roommates” problem
Recommended article: On a generalization of the stable roommates problem
Recommended article: ``Almost stable'' matchings in the roommates problem with bounded preference lists
Recommended article: The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems
Recommended article: A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings
Recommended article: An algorithm for a super-stable roommates problem
Recommended article: The ``stable roommates'' problem with random preferences
description: scientific article; zbMATH DE number 4170096