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

DOI10.1016/J.IC.2023.105128MaRDI QIDQ6178460zbMATH OpenOpenAlexFDO

Authors Robert Bredereck, Jun-Jie Luo

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 complexityjudgment aggregationsocial choice theory

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Complexity of control in judgment aggregation for uniform premise-based quota rules
• Complexity of judgment aggregation
• Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
• Computational aspects of manipulation and control in judgment aggregation
• How hard is it to control an election?
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• Judgment aggregation
• On complexity of lobbying in multiple referenda
• Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
• Robustness among multiwinner voting rules
• The complexity landscape of outcome determination in judgment aggregation
• The computational difficulty of manipulating an election
• The shield that never was: societies with single-peaked preferences are more open to manipulation and control
• The theory of judgment aggregation: an introductory review

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178460)