Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types

摘要

Manipulation of judgment aggregation procedures has first been studied by List [14] and Dietrich and List [8], and Endriss et al. [9] were the first to study it from a computational perspective. Baumeister et al. [2,3,6] introduced the concepts of bribery and control in judgment aggregation and studied their algorithmic and complexity-theoretic properties. However, their results are restricted to Hamming-distance-respecting preferences and their results on bribery apply to the premise-based procedure only. We extend these results to more general preference notions, including closeness-respecting and top-respecting preferences that are due to Dietrich and List and have been applied to manipulation in judgment aggregation by Baumeister et al. [4,5]. In addition, our results apply to uniform premise-based quota rules that generalize the premise-based procedure.