Three-Dimensional Stabl Matching Problems

From MaRDI portal
Publication:3348423

DOI10.1137/0404023zbMath0726.68046OpenAlexW1501062330MaRDI QIDQ3348423

Cheng Ng, Daniel S. Hirschberg

Publication date: 1991

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0404023




Related Items (32)

The Price of Matching with Metric Preferences\(d\)-dimensional stable matching with cyclic preferencesOn the complexity of stable hypergraph matching, stable multicommodity flow and related problemsThe three-dimensional stable roommates problem with additively separable preferencesReview of the theory of stable matchings and contract systemsHedonic diversity games: a complexity picture with more than two colorsComputing relaxations for the three-dimensional stable matching problem with cyclic preferencesSolving stable matching problems using answer set programmingBalancing stability and efficiency in team formation as a generalized roommate problemStrategyproof mechanism for two-sided matching with resource allocationCoalitional unanimity versus strategy-proofness in coalition formation problemsNovel integer programming models for the stable kidney exchange problemOn random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferencesPareto optimality in coalition formationThree-sided stable matchings with cyclic preferencesCircular stable matching and 3-way kidney transplantTwo hardness results for core stability in hedonic coalition formation gamesBistable versions of the marriages and roommates problemsThe stable marriage problem: an interdisciplinary review from the physicist's perspectiveThree-sided stable matching problem with two of them as cooperative partnersThree-dimensional stable matching with hybrid preferencesThree-dimensional stable matching with cyclic preferencesThree-dimensional stable matching with cyclic preferencesGeometric stable roommatesOn the complexity of exchange-stable roommatesHardness results for stable exchange problemsOn the existence of three-dimensional stable matchings with cyclic preferencesThree-sided matching problem with mixed preferencesThe stable crews problemA collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferencesThe exchange-stable marriage problemBalanced weights and three-sided coalition formation




This page was built for publication: Three-Dimensional Stabl Matching Problems