Recommendations
- Fractional solutions for capacitated NTU-games, with applications to stable matchings
- Stable matching with couples: an empirical study
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples
- Some things couples always wanted to know about stable matchings (but were afraid to ask)
- Stable matchings with couples
Cites work
- scientific article; zbMATH DE number 1305096 (Why is no real title available?)
- College Admissions and the Stability of Marriage
- College admissions with stable score-limits
- Deferred acceptance algorithms: history, theory, practice, and open questions
- Fractional solutions for capacitated NTU-games, with applications to stable matchings
- Keeping partners together: Algorithmic results for the hospitals/residents problem with couples
- Many-to-One Stable Matching: Geometry and Fairness
- Matching with couples: a multidisciplinary survey
- NP-complete stable matching problems
- On a lemma of Scarf.
- Some things couples always wanted to know about stable matchings (but were afraid to ask)
- Stable assignment with couples: parameterized complexity and local search
- Stable matching with couples: an empirical study
- Stable matchings and preferences of couples
- Stable matchings with couples
- The Core of an N Person Game
Cited in
(6)- Finding all stable matchings with couples
- On the complexity of stable fractional hypergraph matching
- Complexity of finding Pareto-efficient allocations of highest welfare
- On the complexity of stable hypergraph matching, stable multicommodity flow and related problems
- Refugee allocation in the setting of hedonic games
- Fractional solutions for capacitated NTU-games, with applications to stable matchings
This page was built for publication: Matching couples with Scarf's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314433)
