The strongly stable roommates problem

DOI10.4230/LIPICS.ESA.2016.60zbMATH Open1397.68104OpenAlexW2558206227MaRDI QIDQ4606332FDOQ4606332

Adam Kunysz

Publication date: 2 March 2018

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.ESA.2016.60

Recommendations

• The Stable Roommates Problem with Ties
• Characterisation of strongly stable matchings
• Strongly stable matchings in time \(O(nm)\) and extension to the hospitals-residents problem
• STACS 2004
• The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments

zbMATH Keywords

rotationsmatching theorystable roommatesstrongly stable matching

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)

Cited In (19)

• The ``stable roommates problem with random preferences
• The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
• The Stable Roommates Problem with Ties
• A note on roommate problems with a limited number of rooms
• Exchange-stability in roommate problems
• Title not available (Why is that?)
• The stable roommates problem with choice functions
• The roommate problem with externalities
• The stable fixtures problem -- a many-to-many extension of stable roommates
• A General Framework for Stable Roommates Problems using Answer Set Programming
• Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
• Stable Roommates and Constraint Programming
• Adapting stable matchings to forced and forbidden pairs
• The Stable Roommates Problem with Short Lists
• STACS 2004
• Acyclic roommates
• Title not available (Why is that?)
• Stable matching with multilayer approval preferences: approvals can be harder than strict preferences
• Effective data reduction for strongly stable matching in very sparse graphs

This page was built for publication: The strongly stable roommates problem

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