Three-Dimensional Stabl Matching Problems

DOI10.1137/0404023MaRDI QIDQ3348423zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• NP-complete stable matching problems
• A New Approach to Stable Matching Problems
• Stable marriage with general preferences. Extended abstract

Cited in

(36)

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