Three-Dimensional Stabl Matching Problems

DOI10.1137/0404023zbMATH Open0726.68046OpenAlexW1501062330MaRDI QIDQ3348423FDOQ3348423

Authors: 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

Recommendations

• NP-complete stable matching problems
• On the existence of three-dimensional stable matchings with cyclic preferences
• On the existence of three-dimensional stable matchings with cyclic preferences
• A New Approach to Stable Matching Problems
• Stable marriage with general preferences. Extended abstract

zbMATH Keywords

hospitals/residents problemNP-completestable marriage problemthree-dimensional matchingstable roommate problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Operations research and management science (90B99)

Cited In (36)

• The exchange-stable marriage problem
• Two hardness results for core stability in hedonic coalition formation games
• Three-sided stable matching problem with two of them as cooperative partners
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Bistable versions of the marriages and roommates problems
• The price of matching with metric preferences
• Three-sided matching problem with mixed preferences
• Balanced weights and three-sided coalition formation
• The stable crews problem
• Three-dimensional stable matching with hybrid preferences
• \(d\)-dimensional stable matching with cyclic preferences
• Hedonic diversity games: a complexity picture with more than two colors
• Nash stability in fractional hedonic games with bounded size coalitions
• Balancing stability and efficiency in team formation as a generalized roommate problem
• Three-dimensional stable matching with cyclic preferences
• Three-dimensional stable matching with cyclic preferences
• On the existence of three-dimensional stable matchings with cyclic preferences
• Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
• On the complexity of stable hypergraph matching, stable multicommodity flow and related problems
• The three-dimensional stable roommates problem with additively separable preferences
• On the complexity of exchange-stable roommates
• Solving stable matching problems using answer set programming
• Circular stable matching and 3-way kidney transplant
• Three-sided stable matchings with cyclic preferences
• Egalitarian roommate allocations: complexity and stability
• NP-complete stable matching problems
• Coalitional unanimity versus strategy-proofness in coalition formation problems
• The stable marriage problem: an interdisciplinary review from the physicist's perspective
• On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences
• A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences
• Strategyproof mechanism for two-sided matching with resource allocation
• Pareto optimality in coalition formation
• Geometric stable roommates
• Hardness results for stable exchange problems
• Review of the theory of stable matchings and contract systems
• Novel integer programming models for the stable kidney exchange problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348423)