On the hardness of bribery variants in voting with CP-nets
From MaRDI portal
Publication:314427
DOI10.1007/s10472-015-9469-3zbMath1345.91006arXiv1410.5186OpenAlexW3100938019MaRDI QIDQ314427
Publication date: 16 September 2016
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.5186
Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12) Group preferences (91B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Social choice (91B14)
Related Items (4)
Often Harder than in the Constructive Case: Destructive Bribery in CP-nets ⋮ How hard is safe bribery? ⋮ Local distance constrained bribery in voting ⋮ Frugal bribery in voting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Campaign management under approval-driven voting rules
- Sequential composition of voting rules in multi-issue domains
- Multivariate complexity analysis of Swap Bribery
- Towards a dichotomy for the possible winner problem in elections based on scoring rules
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
- Bribery in voting with CP-nets
- On complexity of lobbying in multiple referenda
- Parametrized complexity theory.
- Computational Aspects of Approval Voting
- An Efficient Procedure for Collective Decision-making with CP-nets
- Maximal Flow Through a Network
- Swap Bribery
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- How Hard Is Bribery in Elections?
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Reducibility among Combinatorial Problems
- Barriers to Manipulation in Voting
- Control and Bribery in Voting
- A Richer Understanding of the Complexity of Election Systems
- Discrete-Variable Extremum Problems
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
This page was built for publication: On the hardness of bribery variants in voting with CP-nets
