Generalised stable partitions characterize the solution space of many-to-many non-bipartite stable matching, giving a solvability certificate and improved near-feasible algorithms.
Control in Stable Marriage and Stable Roommates: Complexity and Algorithms
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We study control problems in the context of matching under preferences: We examine how a central authority, called the controller, can manipulate an instance of the Stable Marriage or Stable Roommates problems in order to achieve certain goals. We investigate the computational complexity of the emerging problems, and provide both efficient algorithms and intractability results.
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching
Generalised stable partitions characterize the solution space of many-to-many non-bipartite stable matching, giving a solvability certificate and improved near-feasible algorithms.