On the hardness of bribery variants in voting with CP-nets

被引：8

作者：

Dorn, Britta ^{[1
]}

Krueger, Dominikus ^{[2
]}

机构：

[1] Univ Tubingen, Dept Comp Sci, Fac Sci, Tubingen, Germany

[2] Univ Ulm, Inst Theoret Comp Sci, Ulm, Germany

来源：

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE | 2016年 / 77卷 / 3-4期

关键词：

Computational Social Choice; Voting; Bribery; CP-nets; COMPLEXITY; MANIPULATION;

D O I：

10.1007/s10472-015-9469-3

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We continue previous work by Mattei et al. (Ann. Math. Artif. Intell. 1042 68(1-3), 135-160 2013) in which they study the computational complexity of bribery schemes when voters have conditional preferences modeled as CP-nets. For most of the cases they considered, they showed that the bribery problem is solvable in polynomial time. Some cases remained open-we solve several of them and extend the previous results to the case that voters are weighted. Additionally, we consider negative (weighted) bribery in CP-nets, when the briber is not allowed to pay voters to vote for his preferred candidate.

引用

页码：251 / 279

页数：29

共 50 条

[21] CP-nets with Indifference (Invited Paper)
Allen, Thomas E.
2013 51ST ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2013, : 1488 - 1495
[22] Generating CP-Nets Uniformly at Random
Allen, Thomas E.
Goldsmith, Judy
Justice, Hayden E.
Mattei, Nicholas
Raines, Kayla
THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, : 872 - 878
[23] A Tool to Graphically Edit CP-Nets
Shafran, Aidan
Saarinen, Sam
Goldsmith, Judy
THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, : 4387 - 4388
[24] Optimal Decision Making with CP-nets and PCP-nets
Sikdar, Sujoy
Adali, Sibel
Xia, Lirong
AAMAS'17: PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, 2017, : 1736 - 1738
[25] The computational complexity of dominance and consistency in CP-nets
Goldsmith, Judy
Lang, Jerome
Truszczynski, Miroslaw
Wilson, Nic
19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 144 - 149
[26] A Parameterized Complexity Analysis of Generalized CP-Nets
Kronegger, Martin
Lackner, Martin
Pfandler, Andreas
Pichler, Reinhard
PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2014, : 1091 - 1097
[27] Semantic information retrieval based on CP-Nets
Boubekeur, Fatiha
Boughanem, Mohand
Tamine-Lechani, Lynda
2007 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-4, 2007, : 809 - 815
[28] Rank Pruning for Dominance Queries in CP-Nets
Laing, Kathryn
Thwaites, Peter Adam
Gosling, John Paul
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2019, 64 : 55 - 107
[29] The computational complexity of dominance and consistency in CP-Nets
Goldsmith, Judy
Lang, Jérôme
Truszczyński, Miroslaw
Wilson, Nic
Journal of Artificial Intelligence Research, 2008, 33 : 403 - 432
[30] Using CP-nets as a Guide for Countermeasure Selection
Bistarelli, Stefano
Fioravanti, Fabio
Peretti, Pamela
APPLIED COMPUTING 2007, VOL 1 AND 2, 2007, : 300 - 304

← 1 2 3 4 5 →