PP-2011-13: Binary Aggregation with Integrity Constraints

PP-2011-13: Grandi, Umberto and Endriss, Ulle (2011) Binary Aggregation with Integrity Constraints. [Report]

[img]
Preview
Text (Full Text)
PP-2011-13.text.pdf

Download (161kB) | Preview
[img] Text (Abstract)
PP-2011-13.abstract.txt

Download (1kB)

Abstract

Binary aggregation studies problems in which individuals express yes/no choices over a number of possibly correlated issues, and these individual choices need to be aggregated into a collective choice. We show how several classical frameworks of Social Choice Theory, particularly preference and judgment aggregation, can be viewed as binary aggregation problems by designing an appropriate set of integrity constraints for each specific setting. We explore the generality of this framework, showing that it makes available useful techniques both to prove theoretical results, such as a new impossibility theorem in preference aggregation, and to analyse practical problems, such as the characterisation of safe agendas in judgment aggregation in a syntactic way. The framework also allows us to formulate a general definition of paradox that is independent of the domain under consideration, which gives rise to the study of the class of aggregation procedures of generalised dictatorships.

Item Type: Report
Report Nr: PP-2011-13
Series Name: Prepublication (PP) Series
Year: 2011
Uncontrolled Keywords: computational social choice; judgment aggregation; preference aggregation
Subjects: Computation
Depositing User: Ulle Endriss
Date Deposited: 12 Oct 2016 14:37
Last Modified: 12 Oct 2016 14:37
URI: https://eprints.illc.uva.nl/id/eprint/417

Actions (login required)

View Item View Item