Bribery and Control in Stable Marriage

Niclas Boehmer; Robert Bredereck; Klaus Heeger; Rolf Niedermeier

doi:10.1007/978-3-030-57980-7_11

Bribery and Control in Stable Marriage

Niclas Boehmer
, Robert Bredereck
, Klaus Heeger
, Rolf Niedermeier

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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’ 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.

Original language	English
Title of host publication	Algorithmic Game Theory - 13th International Symposium, SAGT 2020, Proceedings
Editors	Tobias Harks, Max Klimm
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	163-177
Number of pages	15
ISBN (Print)	9783030579791
DOIs	https://doi.org/10.1007/978-3-030-57980-7_11
State	Published - 1 Jan 2020
Externally published	Yes
Event	13th International Symposium on Algorithmic Game Theory, SAGT 2020 - Augsburg, Germany Duration: 16 Sep 2020 → 18 Sep 2020

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12283 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	13th International Symposium on Algorithmic Game Theory, SAGT 2020
Country/Territory	Germany
City	Augsburg
Period	16/09/20 → 18/09/20

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 16 Peace, Justice and Strong Institutions

Keywords

Manipulation
Matching markets
Parameterized hardness
Polynomial-time algorithms
Stable matching
Strategic behavior

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-030-57980-7_11

Cite this

Boehmer, N., Bredereck, R., Heeger, K., & Niedermeier, R. (2020). Bribery and Control in Stable Marriage. In T. Harks, & M. Klimm (Eds.), Algorithmic Game Theory - 13th International Symposium, SAGT 2020, Proceedings (pp. 163-177). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12283 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-57980-7_11

Boehmer, Niclas ; Bredereck, Robert ; Heeger, Klaus et al. / Bribery and Control in Stable Marriage. Algorithmic Game Theory - 13th International Symposium, SAGT 2020, Proceedings. editor / Tobias Harks ; Max Klimm. Springer Science and Business Media Deutschland GmbH, 2020. pp. 163-177 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d819ba63ad6d44899174b1ef9c766cac,

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",

}

Boehmer, N, Bredereck, R, Heeger, K & Niedermeier, R 2020, Bribery and Control in Stable Marriage. in T Harks & M Klimm (eds), Algorithmic Game Theory - 13th International Symposium, SAGT 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12283 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 163-177, 13th International Symposium on Algorithmic Game Theory, SAGT 2020, Augsburg, Germany, 16/09/20. https://doi.org/10.1007/978-3-030-57980-7_11

Bribery and Control in Stable Marriage. / Boehmer, Niclas; Bredereck, Robert; Heeger, Klaus et al.
Algorithmic Game Theory - 13th International Symposium, SAGT 2020, Proceedings. ed. / Tobias Harks; Max Klimm. Springer Science and Business Media Deutschland GmbH, 2020. p. 163-177 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12283 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Bribery and Control in Stable Marriage

AU - Boehmer, Niclas

AU - Bredereck, Robert

AU - Heeger, Klaus

AU - Niedermeier, Rolf

PY - 2020/1/1

Y1 - 2020/1/1

N2 - 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’ 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.

AB - 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’ 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.

KW - Manipulation

KW - Matching markets

KW - Parameterized hardness

KW - Polynomial-time algorithms

KW - Stable matching

KW - Strategic behavior

UR - https://www.scopus.com/pages/publications/85091327438

U2 - 10.1007/978-3-030-57980-7_11

DO - 10.1007/978-3-030-57980-7_11

M3 - Conference contribution

AN - SCOPUS:85091327438

SN - 9783030579791

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 163

EP - 177

BT - Algorithmic Game Theory - 13th International Symposium, SAGT 2020, Proceedings

A2 - Harks, Tobias

A2 - Klimm, Max

PB - Springer Science and Business Media Deutschland GmbH

T2 - 13th International Symposium on Algorithmic Game Theory, SAGT 2020

Y2 - 16 September 2020 through 18 September 2020

ER -

Boehmer N, Bredereck R, Heeger K, Niedermeier R. Bribery and Control in Stable Marriage. In Harks T, Klimm M, editors, Algorithmic Game Theory - 13th International Symposium, SAGT 2020, Proceedings. Springer Science and Business Media Deutschland GmbH. 2020. p. 163-177. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-57980-7_11

Bribery and Control in Stable Marriage

Abstract

Publication series

Conference

UN SDGs

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this