Stable marriage with groups of similar agents

DOI10.1007/978-3-030-04612-5_21zbMATH Open1443.91213OpenAlexW3103026194MaRDI QIDQ2190408FDOQ2190408

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)

Cites Work

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

Cited In (2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190408)