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 and Dietrich and List, and Endriss et al. were the first to study it from a computational perspective. Baumeister et al. 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. In addition, our results apply to uniform premise-based quota rules that generalize the premise-based procedure.