The stable fixtures problem -- a many-to-many extension of stable roommates

DOI10.1016/J.DAM.2007.05.015MaRDI QIDQ2384396zbMATH OpenOpenAlexFDO

Authors Robert W. Irving, Sandy Scott

Publication date 21 September 2007

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2007.05.015

zbMATH Keywords

linear-time algorithmmany-to-many non-bipartite matchingStable matching problem

Mathematics Subject Classification ID

Matching models (91B68)

Recommendations

• The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments
• On a generalization of the stable roommates problem
• Approximation and Online Algorithms
• Stable Roommates and Constraint Programming
• An efficient algorithm for the “stable roommates” problem
• The strongly stable roommates problem
• The complexity of approximately counting stable roommate assignments
• A maximum stable matching for the roommates problem
• A new solution concept for the roommate problem: \(\mathcal{Q}\)-stable matchings
• On the existence of stable roommate matchings

Cites work

• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• scientific article; zbMATH DE number 48303 (Why is no real title available?)
• An efficient algorithm for the “stable roommates” problem
• College Admissions and the Stability of Marriage
• Lower Bounds for the Stable Marriage Problem and Its Variants
• Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
• NP-complete stable matching problems
• Stable marriage and indifference
• The Stable Roommates Problem with Ties
• The Structure of the Stable Roommate Problem: Efficient Representation and Enumeration of All Stable Assignments

Cited in

(20)

• Rotations in the stable \(b\)-matching problem
• The Stable Roommates Problem with Ties
• Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains
• Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists
• The stable fixtures problem with payments
• The stable tournament problem: matching sports schedules with preferences
• Stable and meta-stable contract networks
• The integral stable allocation problem on graphs
• A polynomial-time algorithm for the bistable roommates problem
• A General Framework for Stable Roommates Problems using Answer Set Programming
• On the stable \(b\)-matching problem in multigraphs
• The stable fixtures problem with payments
• A necessary and sufficient condition for the existence of a complete stable matching
• Stable Roommates and Constraint Programming
• Finding all stable pairs and solutions to the many-to-many stable matching problem
• The Stable Roommates Problem with Choice Functions
• Subjective homophily and the fixtures problem
• Marriage and Roommate
• Review of the theory of stable matchings and contract systems
• Matching problem of electronic broker based on stable bipartite matching

This page was built for publication: The stable fixtures problem -- a many-to-many extension of stable roommates

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