Stable marriage with groups of similar agents

DOI10.1007/978-3-030-04612-5_21zbMath1443.91213OpenAlexW3103026194MaRDI QIDQ2190408

Baharak Rastegari, Kitty Meeks

Publication date: 18 June 2020

Full work available at URL: http://eprints.gla.ac.uk/171021/7/171021.pdf

zbMATH Keywords

NP-hardnessstable matchinggroups of similar agents

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Matching models (91B68)

Related Items (2)

Stable marriage with groups of similar agents ⋮ Balanced stable marriage: how close is close enough?

Cites Work

• Unnamed Item
• Fundamentals of parameterized complexity
• The complexity of approximately counting stable roommate assignments
• The complexity of approximately counting stable matchings
• Stable marriage with covering constraints -- a complete computational trichotomy
• Size versus stability in the marriage problem
• The stable marriage problem with master preference lists
• Hard variants of stable marriage.
• Parameterized complexity and local search approaches for the stable marriage problem with ties
• Stable marriage with groups of similar agents
• Parametrized complexity theory.
• The Revealed Preference Theory of Stable and Extremal Stable Matchings
• Algorithmics of Matching Under Preferences
• Max flows in O(nm) time, or better
• Parameterized Algorithms
• College Admissions and the Stability of Marriage
• Balanced stable marriage: how close is close enough?

This page was built for publication: Stable marriage with groups of similar agents