Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules

• We extend previous work on the complexity of manipulation in judgment aggregation.
• We consider incomplete judgment sets and various notions of preferences on them.
• We introduce bribery in judgment aggregation and study its complexity.

Endriss et al. (2012) initiated the complexity-theoretic study of problems related to judgment aggregation. We extend their results on the manipulation of two specific judgment aggregation procedures to a whole class of such procedures, namely to uniform premise-based quota rules. In addition, we consider incomplete judgment sets and the notions of top-respecting and closeness-respecting preferences introduced by Dietrich and List (2007). This complements previous work on the complexity of manipulation in judgment aggregation that focused on Hamming-distance-respecting preferences only, which we also study here. Furthermore, inspired by work on bribery in voting (Faliszewski and Rothe, in press), we introduce and study the closely related issue of bribery in judgment aggregation.