A unified approach to finding good stable matchings in the hospitals/residents setting
type: Item
instance of: scholarly article
title: A unified approach to finding good stable matchings in the hospitals/residents setting
zbMATH Open document ID: 1211.90107
author: Ichiro Suzuki
author: Christine T. Cheng
author: Eric J. McDermid
published in: Theoretical Computer Science
publication date: 2008-06-24T00:00:00Z
Mathematics Subject Classification ID: 90B70
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 91B68
zbMATH DE Number: 5292251
zbMATH Keywords: matching hospitals to residents
zbMATH Keywords: college admissions problem
zbMATH Keywords: stable matchings
zbMATH Keywords: meta-rotation poset
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.02.014
OpenAlex ID: W1987936822
cites work: Polynomial time algorithm for an optimal stable assignment with multiple partners
cites work: A new fixed point approach for stable networks and stable marriages
cites work: Submodular functions and optimization
cites work: College Admissions and the Stability of Marriage
cites work: Some remarks on the stable matching problem
cites work: Three Fast Algorithms for Four Problems in Stable Marriage
cites work: Q3995616
cites work: The Complexity of Counting Stable Marriages
cites work: Q4130997
cites work: Hardness results on the man-exchange stable marriage problem with short preference lists
cites work: Maximal Closure of a Graph and Applications to Combinatorial Problems
cites work: Selected Applications of Minimum Cuts in Networks
cites work: The College Admissions Problem Revisited
cites work: Q3999327
cites work: Many-to-One Stable Matching: Geometry and Fairness
cites work: The geometry of fractional stable matchings and its applications
DOI: 10.1016/J.TCS.2008.02.014
Recommended article: Socially Stable Matchings in the Hospitals/Residents Problem
Recommended article: ``Almost-stable'' matchings in the hospitals/residents problem with couples
Recommended article: STACS 2004
Recommended article: Strongly stable matchings in time O ( nm ) and extension to the hospitals-residents problem
Recommended article: A unifying approach to the structures of the stable matching problems
Recommended article: A New Approach to Stable Matching Problems
Recommended article: Keeping partners together: Algorithmic results for the hospitals/residents problem with couples
Recommended article: A generalization of the stable matching problem
Recommended article: Q4763383
Recommended article: Stable Matchings, Optimal Assignments, and Linear Programming
description: scientific article; zbMATH DE number 5292251