@inproceedings{f4dce2270cc2420088d598b6663fd25f,
title = "Bribery and Control in Stable Marriage",
abstract = "We initiate the study of external manipulations in Stable Marriage by considering several manipulative actions as well as several “desirable” manipulation goals. For instance, one goal is to make sure that a given pair of agents is matched in a stable solution, and this may be achieved by the manipulative action of reordering some agents{\textquoteright} preference lists. We present a comprehensive study of the computational complexity of all problems arising in this way. We find several polynomial-time solvable cases as well as NP-hard ones. For the NP-hard cases, focusing on the natural parameter “budget” (that is, the number of manipulative actions), we also perform a parameterized complexity analysis and encounter parameterized hardness results.",
keywords = "Manipulation, Matching markets, Parameterized hardness, Polynomial-time algorithms, Stable matching, Strategic behavior",
author = "Niclas Boehmer and Robert Bredereck and Klaus Heeger and Rolf Niedermeier",
note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.; 13th International Symposium on Algorithmic Game Theory, SAGT 2020 ; Conference date: 16-09-2020 Through 18-09-2020",
year = "2020",
month = jan,
day = "1",
doi = "10.1007/978-3-030-57980-7_11",
language = "English",
isbn = "9783030579791",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "163--177",
editor = "Tobias Harks and Max Klimm",
booktitle = "Algorithmic Game Theory - 13th International Symposium, SAGT 2020, Proceedings",
address = "Germany",
}
