PP-2013-09: Grandi, Umberto and Endriss, Ulle (2013) Lifting Integrity Constraints in Binary Aggregation. [Report]
Preview |
Text (Full Text)
PP-2013-09.text.pdf Download (515kB) | Preview |
Text (Abstract)
PP-2013-09.abstract.txt Download (786B) |
Abstract
We consider problems in which several individuals each need to make a
yes/no choice regarding a number of issues and these choices then need
to be aggregated into a collective choice. Depending on the
application at hand, different combinations of yes/no may be
considered rational. We describe rationality assumptions as integrity
constraints using a simple propositional language and we explore the
question of whether or not a given aggregation procedure will lift a
given integrity constraint from the individual to the collective
level, i.e., whether the collective choice will be rational whenever
all individual choices are.
Item Type: | Report |
---|---|
Report Nr: | PP-2013-09 |
Series Name: | Prepublication (PP) Series |
Year: | 2013 |
Uncontrolled Keywords: | computational social choice; judgment 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/481 |
Actions (login required)
View Item |