A maximum stable matching for the roommates problem

Recommendations

Approximation and Online Algorithms
On the existence of stable roommate matchings
An efficient algorithm for the “stable roommates” problem
On a generalization of the stable roommates problem
``Almost stable matchings in the roommates problem with bounded preference lists
The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems
A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings
An algorithm for a super-stable roommates problem
The ``stable roommates problem with random preferences

Cites work

A necessary and sufficient condition for the existence of a complete stable matching
An efficient algorithm for the “stable roommates” problem
College Admissions and the Stability of Marriage
scientific article; zbMATH DE number 45086 (Why is no real title available?)
The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments

Cited in

(42)

A maximum b-matching problem arising from median location models with applications to the roommates problem
On a cutting plane heuristic for the stable roommates problem and its applications
A polynomial-time algorithm for the bistable roommates problem
Stable marriage and roommates problems with restricted edges: complexity and approximability
The roommates problem revisited
Bistable versions of the marriages and roommates problems
Stable matching of student-groups to dormitories
Robust and approximately stable marriages under partial information
The stable fixtures problem -- a many-to-many extension of stable roommates
Absorbing sets in roommate problems
A stable matching model with an entrance criterion applied to the assignment of students to dormitories at the Technion
The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems
Random paths to \(P\)-stability in the roommate problem
A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings
Stability against robust deviations in the roommate problem
On a generalization of the stable roommates problem
A necessary and sufficient condition for the existence of a complete stable matching
A Note on the Room-Mates Problem and a Related Revenue Allocation Problem
The Stable Roommates Problem with Globally Ranked Pairs
An efficient algorithm for the “stable roommates” problem
Analysis of stochastic matching markets
The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
Stable matchings and stable partitions^∗
Strongly stable and maximum weakly stable noncrossing matchings
A General Framework for Stable Roommates Problems using Answer Set Programming
Efficient stabilization of cooperative matching games
Stable Roommates and Constraint Programming
Approximation and Online Algorithms
Marriage and Roommate
Balancing stability and efficiency in team formation as a generalized roommate problem
Unilateral stability in matching problems
Weak stability against robust deviations and the bargaining set in the roommate problem
The complexity of matching games: a survey
An algorithm for a super-stable roommates problem
Manipulating the outcome of stable marriage and roommates problems
Local stability in kidney exchange programs
A note on the characterization of stable matchings for general preferences: a fixed point approach
Modifying an instance of the super-stable matching problem
Consistent enlargements of the core in roommate problems
Impossibilities for roommate problems
Geometric stable roommates
Efficient algorithms for generalized stable marriage and roommates problems

This page was built for publication: A maximum stable matching for the roommates problem

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