Constrained stable marriage with free edges or few blocking pairs

DOI10.1007/978-3-030-92681-6_37OpenAlexW4206651844MaRDI QIDQ2150572

Jiong Guo, Yinghui Wen

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_37

zbMATH Keywords

computational complexitysocial choicestable matchingparameterized complexity

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• ``Almost stable matchings in the roommates problem with bounded preference lists
• Stable marriage with covering constraints -- a complete computational trichotomy
• Complexity of the sex-equal stable marriage problem
• The stable marriage problem with ties and restricted edges
• Size versus stability in the marriage problem
• The stable marriage problem with restricted pairs.
• Hard variants of stable marriage.
• ``Almost-stable matchings in the hospitals/residents problem with couples
• Stable marriage and roommates problems with restricted edges: complexity and approximability
• XSAT and NAE-SAT of linear CNF classes
• On a generalization of the stable roommates problem
• Three Fast Algorithms for Four Problems in Stable Marriage
• Stable networks and product graphs
• Approximation and Online Algorithms
• College Admissions and the Stability of Marriage

This page was built for publication: Constrained stable marriage with free edges or few blocking pairs