Complexity of control in judgment aggregation for uniform premise-based quota rules
From MaRDI portal
Publication:2186810
DOI10.1016/j.jcss.2020.03.001zbMath1448.91100OpenAlexW3011288705MaRDI QIDQ2186810
Ann-Kathrin Selker, Dorothea Baumeister, Olivia J. Erdélyi, Gábor Erdélyi, Jörg Rothe
Publication date: 9 June 2020
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2020.03.001
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Social choice (91B14)
Related Items (4)
The possible winner problem with uncertain weights revisited ⋮ The possible winner with uncertain weights problem ⋮ Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas ⋮ The Complexity Landscape of Outcome Determination in Judgment Aggregation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division
- The theory of judgment aggregation: an introductory review
- New candidates welcome! Possible winners with respect to the addition of new candidates
- Independence of clones as a criterion for voting rules
- Methods for distance-based judgment aggregation
- Belief merging and the discursive dilemma: an argument-based account to paradoxes of judgment aggregation
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
- Anyone but him: the complexity of precluding an alternative
- Clustering to minimize the maximum intercluster distance
- How hard is it to control an election?
- The complexity of probabilistic lobbying
- The computational difficulty of manipulating an election
- Control complexity in Bucklin and fallback voting: a theoretical analysis
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
- On complexity of lobbying in multiple referenda
- Complexity theory and cryptology. An introduction to cryptocomplexity.
- Computational Aspects of Approval Voting
- Computational Aspects of Manipulation and Control in Judgment Aggregation
- Search versus Decision for Election Manipulation Problems
- Multimode Control Attacks on Elections
- How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation
- Complexity of Judgment Aggregation
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
- Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types
- When are elections with few candidates hard to manipulate?
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- How Hard Is Bribery in Elections?
- Parameterized Complexity Results for the Kemeny Rule in Judgment Aggregation
- Structural Control in Weighted Voting Games.
- Barriers to Manipulation in Voting
- Control and Bribery in Voting
- Judgment Aggregation
- Handbook of Computational Social Choice
- A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
- Judgment aggregation and agenda manipulation
This page was built for publication: Complexity of control in judgment aggregation for uniform premise-based quota rules
