Complexity of judgment aggregation

Authors:
Ulle Endriss;Umberto Grandi;Daniele Porello
Affiliations:
Institute for Logic, Language and Computation, University of Amsterdam, Amsterdam, The Netherlands;Institute for Logic, Language and Computation, University of Amsterdam, Amsterdam, The Netherlands;Institute for Logic, Language and Computation, University of Amsterdam, Amsterdam, The Netherlands
Venue:
Journal of Artificial Intelligence Research
Year:
2012

Citing 21
Cited 0

More complicated questions about maxima and minima, and some closures of NP

Theoretical Computer Science
Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP

Journal of the ACM (JACM)
On the complexity of integer programming

Journal of the ACM (JACM)
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
The complexity of Kemeny elections

Theoretical Computer Science
Social choice theory, belief merging, and strategy-proofness

Information Fusion
A Short Introduction to Computational Social Choice

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
The equivalence problem for regular expressions with squaring requires exponential space

SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Computational Complexity: A Modern Approach

Computational Complexity: A Modern Approach
Unifying preference and judgment aggregation

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Improved bounds for computing Kemeny rankings

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Representing and aggregating conflicting beliefs

Journal of Artificial Intelligence Research
The strategy-proofness landscape of merging

Journal of Artificial Intelligence Research
Complexity of judgment aggregation: safety of the agenda

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Collective argument evaluation as judgement aggregation

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
On judgment aggregation in abstract argumentation

Autonomous Agents and Multi-Agent Systems
Judgment aggregation rules based on minimization

Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
How hard is it to bribe the judges? a study of the complexity of bribery in judgment aggregation

ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
The QBFEVAL web portal

JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Where are the hard manipulation problems?

Journal of Artificial Intelligence Research
Binary aggregation with integrity constraints

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyse the computational complexity of three problems in judgment aggregation: (1) computing a collective judgment from a profile of individual judgments (the winner determination problem); (2) deciding whether a given agent can influence the outcome of a judgment aggregation procedure in her favour by reporting insincere judgments (the strategic manipulation problem); and (3) deciding whether a given judgment aggregation scenario is guaranteed to result in a logically consistent outcome, independently from what the judgments supplied by the individuals are (the problem of the safety of the agenda). We provide results both for specific aggregation procedures (the quota rules, the premisebased procedure, and a distance-based procedure) and for classes of aggregation procedures characterised in terms of fundamental axioms.