On a generalization of the stable roommates problem
From MaRDI portal
Publication:2944494
DOI10.1145/1077464.1077474zbMath1321.05201OpenAlexW2015602482MaRDI QIDQ2944494
Katarína Cechlárova, Tamás Fleiner
Publication date: 2 September 2015
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1077464.1077474
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Matching models (91B68)
Related Items (26)
Constrained stable marriage with free edges or few blocking pairs ⋮ The stable fixtures problem with payments ⋮ A local interaction dynamic for the matching problem ⋮ Review of the theory of stable matchings and contract systems ⋮ Stable and meta-stable contract networks ⋮ 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 Stable Roommates Problem with Choice Functions ⋮ The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses ⋮ The integral stable allocation problem on graphs ⋮ The stable roommates problem with choice functions ⋮ 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 ⋮ RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES ⋮ Bribery and Control in Stable Marriage ⋮ On the stable \(b\)-matching problem in multigraphs ⋮ Rotations in the stable \(b\)-matching problem ⋮ The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems ⋮ On Stable Matchings and Flows ⋮ Complexity of finding Pareto-efficient allocations of highest welfare ⋮ Efficient algorithms for generalized stable marriage and roommates problems ⋮ The Stable Fixtures Problem with Payments ⋮ Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems ⋮ Matching with partners and projects ⋮ Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
This page was built for publication: On a generalization of the stable roommates problem
