Control in Stable Marriage and Stable Roommates: Complexity and Algorithms
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913675653152768 |
|---|---|
| author | Chen, Jiehua Schlotter, Ildikó |
| author_facet | Chen, Jiehua Schlotter, Ildikó |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_01215 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Control in Stable Marriage and Stable Roommates: Complexity and Algorithms Chen, Jiehua Schlotter, Ildikó Computer Science and Game Theory 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. |
| title | Control in Stable Marriage and Stable Roommates: Complexity and Algorithms |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2502.01215 |