Stable marriage with groups of similar agents
type: Item
instance of: scholarly article
title: Stable marriage with groups of similar agents
zbMATH Open document ID: 1443.91213
DOI: 10.1007/978-3-030-04612-5_21
author: Kitty Meeks
author: Baharak Rastegari
publication date: 2020-06-18T00:00:00Z
full work available at URL: 171021.pdf
Mathematics Subject Classification ID: 91B68
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7213179
zbMATH Keywords: stable matching
zbMATH Keywords: groups of similar agents
zbMATH Keywords: NP-hardness
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3103026194
cites work: Q3579506
cites work: Size versus stability in the marriage problem
cites work: The complexity of approximately counting stable matchings
cites work: The complexity of approximately counting stable roommate assignments
cites work: Parameterized Algorithms
cites work: Fundamentals of parameterized complexity
cites work: The revealed preference theory of stable and extremal stable matchings
cites work: Parametrized complexity theory.
cites work: College Admissions and the Stability of Marriage
cites work: Balanced stable marriage: how close is close enough?
cites work: The stable marriage problem with master preference lists
cites work: Algorithmics of Matching Under Preferences
cites work: Hard variants of stable marriage.
cites work: Parameterized complexity and local search approaches for the stable marriage problem with ties
cites work: Stable marriage with covering constraints -- a complete computational trichotomy
cites work: Max flows in O(nm) time, or better
description: scientific article; zbMATH DE number 7213179