Control in Stable Marriage and Stable Roommates: Complexity and Algorithms
arXiv:2502.01215
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.