Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Llull and Copeland voting computationally resist bribery and constructive control
Journal of Artificial Intelligence Research
How hard is bribery in elections?
Journal of Artificial Intelligence Research
Making decisions based on the preferences of multiple agents
Communications of the ACM
The Complexity of Probabilistic Lobbying
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Complexity of judgment aggregation: safety of the agenda
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Using complexity to protect elections
Communications of the ACM
Parameterized Complexity
Complexity of judgment aggregation
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
Endriss et al. [1,2] initiated the complexity-theoretic study of problems related to judgment aggregation. We extend their results for manipulating two specific judgment aggregation procedures to a whole class of such procedures, and we obtain stronger results by considering not only the classical complexity (NP-hardness) but the parameterized complexity (W[2]-hardness) of these problems with respect to natural parameters. Furthermore, we introduce and study the closely related issue of bribery in judgment aggregation, inspired by work on bribery in voting (see, e.g., [3,4,5]). In manipulation scenarios one of the judges seeks to influence the outcome of the judgment aggregation procedure used by reporting an insincere judgment set. In bribery scenarios, however, an external actor, the briber, seeks to influence the outcome of the judgment aggregation procedure used by bribing some of the judges without exceeding his or her budget. We study three variants of bribery and show W[2]-hardness of the corresponding problems for natural parameters and for one specific judgment aggregation procedure. We also show that in certain special cases one can determine in polynomial time whether there is a successful bribery action.