Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems
From MaRDI portal
Publication:3527247
Recommendations
Cited in
(17)- Three-sided stable matchings with cyclic preferences
- Circular stable matching and 3-way kidney transplant
- Three-sided matching problem with mixed preferences
- A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences
- On the complexity of stable hypergraph matching, stable multicommodity flow and related problems
- Matching through institutions
- The stable marriage problem: an interdisciplinary review from the physicist's perspective
- Unpopularity factor in the Marriage and Roommates problems
- The three-dimensional stable roommates problem with additively separable preferences
- The price of matching with metric preferences
- Review of the theory of stable matchings and contract systems
- Hedonic diversity games: a complexity picture with more than two colors
- Balancing stability and efficiency in team formation as a generalized roommate problem
- Strategyproof mechanism for two-sided matching with resource allocation
- Egalitarian roommate allocations: complexity and stability
- Multi-dimensional stable roommates in 2-dimensional Euclidean space
- Geometric stable roommates
This page was built for publication: Two’s Company, Three’s a Crowd: Stable Family and Threesome Roommates Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527247)