Often Harder than in the Constructive Case: Destructive Bribery in CP-nets

DOI10.1007/978-3-662-48995-6_23zbMath1406.91113arXiv1509.08628MaRDI QIDQ3460798

Britta Dorn, Dominikus Krüger, Patrick Scharpfenecker

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

zbMATH Keywords

voting; computational social choice; bribery; CP-nets; destructive

Mathematics Subject Classification ID

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

91B14: Social choice

Uses Software

• CP-nets