Complexity of Judgment Aggregation

Journal of Artificial Intelligence Research 45:481--514 (2012)
  Copy   BIBTEX

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.

Author Profiles

Daniele Porello
Università degli Studi di Genova
Ulle Endriss
University of Amsterdam

Analytics

Added to PP
2013-06-14

Downloads
195 (#41,618)

6 months
16 (#56,957)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?