Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas

DOI10.1016/j.ic.2023.105128OpenAlexW4389166531MaRDI QIDQ6178460

Jun-Jie Luo, Robert Bredereck

Publication date: 18 January 2024

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2023.105128

zbMATH Keywords

computational complexitysocial choice theoryjudgment aggregation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• The theory of judgment aggregation: an introductory review
• The shield that never was: societies with single-peaked preferences are more open to manipulation and control
• Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
• How hard is it to control an election?
• The computational difficulty of manipulating an election
• Complexity of control in judgment aggregation for uniform premise-based quota rules
• On complexity of lobbying in multiple referenda
• Computational Aspects of Manipulation and Control in Judgment Aggregation
• Complexity of Judgment Aggregation
• Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
• Judgment Aggregation
• The Complexity Landscape of Outcome Determination in Judgment Aggregation
• Robustness among multiwinner voting rules

This page was built for publication: Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas