NP-complete stable matching problems
From MaRDI portal
Publication:3485870
DOI10.1016/0196-6774(90)90007-2zbMATH Open0705.68065DBLPjournals/jal/Ronn90OpenAlexW2000017271WikidataQ63443885 ScholiaQ63443885MaRDI QIDQ3485870FDOQ3485870
Authors: Eytan Ronn 
Publication date: 1990
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(90)90007-2
Recommendations
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (61)
- A General Framework for Stable Roommates Problems using Answer Set Programming
- Stable dinner party seating arrangements
- Balancing stability and efficiency in team formation as a generalized roommate problem
- Perfect matching in bipartite hypergraphs subject to a demand graph
- Egalitarian roommate allocations: complexity and stability
- Strategic issues in one-to-one matching with externalities
- Complexity of the sex-equal stable marriage problem
- Stability and Nash implementation in matching markets with couples
- Stable marriage and indifference
- Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
- The hospitals/residents problem with lower quotas
- Stable matching of student-groups to dormitories
- Finding all stable matchings with couples
- Solving hard stable matching problems involving groups of similar agents
- The exchange-stable marriage problem
- The stable roommates problem with short lists
- Two hardness results for core stability in hedonic coalition formation games
- How hard is it to satisfy (almost) all roommates?
- Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists
- Size versus stability in the marriage problem
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples
- The stable crews problem
- Approximability results for stable marriage problems with ties.
- The stable fixtures problem -- a many-to-many extension of stable roommates
- Size Versus Stability in the Marriage Problem
- Splitting a configuration in a simplex
- Matching couples with Scarf's algorithm
- Matching with sizes (or scheduling with processing set restrictions)
- Stable assignment with couples: parameterized complexity and local search
- Paths to stability for matching markets with couples
- Stable matchings and preferences of couples
- Computational complexity of stable partitions with b-preferences
- Borda-induced hedonic games with friends, enemies, and neutral players
- Non-existence of stable social groups in information-driven networks
- The Stable Roommates Problem with Short Lists
- Stable matchings of teachers to schools
- Stable partitions with \(\mathcal W\)-preferences
- Housing markets through graphs
- On the complexity of exchange-stable roommates
- An unfeasible matching problem
- Integer programming methods for special college admissions problems
- Stability in large matching markets with complementarities
- Testing substitutability of weak preferences
- Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems
- Hard variants of stable marriage.
- Three-sided stable matchings with cyclic preferences
- Fractional solutions for capacitated NTU-games, with applications to stable matchings
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- An algorithm for a super-stable roommates problem
- COALITION FORMATION GAMES: A SURVEY
- Deferred acceptance algorithms: history, theory, practice, and open questions
- Efficient algorithms for generalized stable marriage and roommates problems
- Pareto optimality in coalition formation
- Geometric stable roommates
- Complexity study for the robust stable marriage problem
- Parameterized algorithms for stable matching with ties and incomplete lists
- Some things couples always wanted to know about stable matchings (but were afraid to ask)
- Review of the theory of stable matchings and contract systems
- Matching with couples: a multidisciplinary survey
- ``Almost-stable matchings in the hospitals/residents problem with couples
- Stable roommate with narcissistic, single-peaked, and single-crossing preferences
This page was built for publication: NP-complete stable matching problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3485870)
