Often Harder than in the Constructive Case: Destructive Bribery in CP-nets
From MaRDI portal
Publication:3460798
DOI10.1007/978-3-662-48995-6_23zbMath1406.91113arXiv1509.08628OpenAlexW2283003757MaRDI QIDQ3460798
Patrick Scharpfenecker, Dominikus Krüger, Britta Dorn
Publication date: 8 January 2016
Published in: Web and Internet Economics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.08628
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Social choice (91B14)
Related Items (1)
Uses Software
Cites Work
- On the hardness of bribery variants in voting with CP-nets
- Anyone but him: the complexity of precluding an alternative
- Bribery in voting with CP-nets
- Often Harder than in the Constructive Case: Destructive Bribery in CP-nets
- Swap Bribery
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- How Hard Is Bribery in Elections?
- A Richer Understanding of the Complexity of Election Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Often Harder than in the Constructive Case: Destructive Bribery in CP-nets