Bribery and control in stable marriage

Niclas Boehmer; Robert Bredereck; Klaus Heeger; Rolf Niedermeier

doi:10.1613/JAIR.1.12755

Bribery and control in stable marriage

Niclas Boehmer, Robert Bredereck, Klaus Heeger, Rolf Niedermeier

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

Abstract

We initiate the study of external manipulations in Stable Marriage by considering several manipulative actions as well as several 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 one is allowed to perform), we also conduct a parameterized complexity analysis and encounter mostly parameterized hardness results.

Original language	English
Pages (from-to)	993-1048
Number of pages	56
Journal	Journal Of Artificial Intelligence Research
Volume	71
DOIs	https://doi.org/10.1613/JAIR.1.12755
State	Published - 1 Jan 2021
Externally published	Yes

ASJC Scopus subject areas

Artificial Intelligence

UN SDGs

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

Access to Document

10.1613/JAIR.1.12755

Cite this

@article{5d46b44d2ee549758829b5010ab73d73,

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 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 one is allowed to perform), we also conduct a parameterized complexity analysis and encounter mostly parameterized hardness results.",

author = "Niclas Boehmer and Robert Bredereck and Klaus Heeger and Rolf Niedermeier",

year = "2021",

month = jan,

day = "1",

doi = "10.1613/JAIR.1.12755",

language = "English",

volume = "71",

pages = "993--1048",

journal = "Journal Of Artificial Intelligence Research",

issn = "1076-9757",

publisher = "Morgan Kaufmann Publishers, Inc.",

}

TY - JOUR

T1 - Bribery and control in stable marriage

AU - Boehmer, Niclas

AU - Bredereck, Robert

AU - Heeger, Klaus

AU - Niedermeier, Rolf

PY - 2021/1/1

Y1 - 2021/1/1

N2 - We initiate the study of external manipulations in Stable Marriage by considering several manipulative actions as well as several 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 one is allowed to perform), we also conduct a parameterized complexity analysis and encounter mostly parameterized hardness results.

AB - We initiate the study of external manipulations in Stable Marriage by considering several manipulative actions as well as several 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 one is allowed to perform), we also conduct a parameterized complexity analysis and encounter mostly parameterized hardness results.

UR - http://www.scopus.com/inward/record.url?scp=85114828627&partnerID=8YFLogxK

U2 - 10.1613/JAIR.1.12755

DO - 10.1613/JAIR.1.12755

M3 - Article

AN - SCOPUS:85114828627

SN - 1076-9757

VL - 71

SP - 993

EP - 1048

JO - Journal Of Artificial Intelligence Research

JF - Journal Of Artificial Intelligence Research

ER -

Bribery and control in stable marriage

Abstract

ASJC Scopus subject areas

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this