A new solution concept for the roommate problem: Q-stable matchings

DOI10.1016/J.MATHSOCSCI.2015.12.001zbMATH Open1347.91200OpenAlexW2217738525MaRDI QIDQ2634485FDOQ2634485

Péter Biró, Elena Molis, Elena Inarra

Publication date: 9 February 2016

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2015.12.001

Recommendations

• A maximum stable matching for the roommates problem
• Random paths to \(P\)-stability in the roommate problem
• The roommates problem revisited
• The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
• Stochastic stability for roommate markets

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Approximation and Online Algorithms
• College Admissions and the Stability of Marriage
• The stability of hedonic coalition structures
• Random Paths to Stability in Two-Sided Matching
• Smith and Rawls share a room: stability and medians
• Algorithmics of Matching Under Preferences
• Random paths to stability in the roommate problem
• On the formation of interaction networks in social coordination games.
• Popular Matchings in the Marriage and Roommates Problems
• Stochastic stability for roommate markets
• The Pareto-stability concept is a natural solution concept for discrete matching markets with indifferences
• Collective Choice Correspondences as Admissible Outcomes of Social Bargaining Processes
• The roommates problem revisited
• Impossibilities for roommate problems
• A generalization of the stable matching problem
• 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 necessary and sufficient condition for the existence of a complete stable matching
• A maximum stable matching for the roommates problem
• Pairwise kidney exchange
• Stable matchings and stable partitions^∗
• An upper bound for the solvability probability of a random stable roommates instance
• On the existence of stable roommate matchings
• Absorbing sets in roommate problems
• When do stable roommate matchings exist? A review
• Consistency and population sensitivity properties in marriage and roommate markets
• Monotonicity and consistency in matching markets
• Title not available (Why is that?)
• The stable crews problem
• Strategic complementarities and unraveling in matching markets

Cited In (8)

• A maximum stable matching for the roommates problem
• The roommate problem with externalities
• Weak stability against robust deviations and the bargaining set in the roommate problem
• The stable fixtures problem -- a many-to-many extension of stable roommates
• A bargaining set for roommate problems
• Balancing stability and efficiency in team formation as a generalized roommate problem
• Stability against robust deviations in the roommate problem
• Stable marriage and roommates problems with restricted edges: complexity and approximability

This page was built for publication: A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings

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