We revisit the computational complexity for various Manipulation and Bribery problems in premise-based judgment aggregation, now focusing on simple and ...

Feb 25, 2024 · Title:Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas. Authors:Robert Bredereck, Junjie Luo.

We revisit the computational complexity for various Manipulation and Bribery problems in judgment aggregation, now focusing on simple and realistic formulas. We ...

Dec 31, 2023 · We revisit the computational complexity for various Manipulation and Bribery problems in premise-based judgment aggregation, now focusing on ...

Apr 12, 2024 · How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation. Algorithmic Decision Theory.

In Section 3 we study the complexity of manip- ulation in judgment aggregation for premise-based quota rules, and in Section 4 that of bribery in judgment ...

Semantic Scholar extracted view of "Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas" by Robert Bredereck ...

We study a general aggregation problem in which a society has to determine its position on each of several issues, based on the positions of the members of ...

May 17, 2019 · Premise-Based Judgment Aggregation with Simple Formulas. ... plexity of manipulation and bribery in judgment aggregation for uniform premise-.

Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas ... To read the full-text of this research, you can request a ...