Complexity of Judgment Aggregation

Download Edit this record How to cite View on PhilPapers
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.
PhilPapers/Archive ID
ENDCOJ
Revision history
Archival date: 2018-09-13
View upload history
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Judgement Aggregation in Non-Classical Logics.Daniele Porello - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):106-139.

Add more citations

Added to PP index
2013-06-14

Total views
14 ( #36,363 of 38,038 )

Recent downloads (6 months)
5 ( #34,157 of 38,038 )

How can I increase my downloads?

Monthly downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.