All 27 control problems for stable marriage and stable roommates are classified, with new NP-completeness results for adding agents and a new polynomial algorithm for deleting agents in roommates.
Almost stable
1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.
1
Pith paper citing it
2
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.GT 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Control in Stable Marriage and Stable Roommates: Complexity and Algorithms
All 27 control problems for stable marriage and stable roommates are classified, with new NP-completeness results for adding agents and a new polynomial algorithm for deleting agents in roommates.