On a generalization of the stable roommates problem
From MaRDI portal
Recommendations
- The stable fixtures problem -- a many-to-many extension of stable roommates
- A generalization of the stable matching problem
- A maximum stable matching for the roommates problem
- The Stable Roommates Problem with Choice Functions
- The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
Cited in
(46)- Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems
- The stable fixtures problem with payments
- The stable tournament problem: matching sports schedules with preferences
- Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists
- On stable matchings and flows
- A generalization of the stable matching problem
- The integral stable allocation problem on graphs
- The stable roommates problem with choice functions
- Complexity of finding Pareto-efficient allocations of highest welfare
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
- Stable matching of student-groups to dormitories
- Constrained stable marriage with free edges or few blocking pairs
- A local interaction dynamic for the matching problem
- Exchange-stability in roommate problems
- Matching with partners and projects
- The stable fixtures problem -- a many-to-many extension of stable roommates
- On the stable \(b\)-matching problem in multigraphs
- The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems
- The Stable Roommates Problem with Short Lists
- The stable fixtures problem with payments
- On stable matchings and flows
- The Stable Roommates Problem with Ties
- A Note on the Room-Mates Problem and a Related Revenue Allocation Problem
- The Stable Roommates Problem with Choice Functions
- The Stable Roommates Problem with Globally Ranked Pairs
- An efficient algorithm for the “stable roommates” problem
- On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm
- A generalization of the lone wolf theorem
- Randomized self-stabilizing leader election in preference-based anonymous trees
- A General Framework for Stable Roommates Problems using Answer Set Programming
- Bribery and control in stable marriage
- Stable Roommates and Constraint Programming
- Review of the theory of stable matchings and contract systems
- Stable and meta-stable contract networks
- Marriage and Roommate
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
- Balancing stability and efficiency in team formation as a generalized roommate problem
- The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses
- A note on roommate problems with a limited number of rooms
- Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains
- Unsolvability and beyond in many-to-many non-bipartite stable matching
- The ``stable roommates problem with random preferences
- Assigning tasks to pairs
- A maximum stable matching for the roommates problem
- Rotations in the stable b-matching problem
- Efficient algorithms for generalized stable marriage and roommates problems
This page was built for publication: On a generalization of the stable roommates problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944494)