PP-2010-02: Endriss, Ulle and Grandi, Umberto and Porello, Daniele (2010) Complexity of Judgment Aggregation: Safety of the Agenda. [Report]
Preview |
Text (Full Text)
PP-2010-02.text.pdf Download (169kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
PP-2010-02.abstract.txt Download (969B) |
Abstract
Aggregating the judgments of a group of agents regarding a set of
interdependent propositions can lead to inconsistent outcomes. One of
the parameters involved is the agenda, the set of propositions on
which agents are asked to express an opinion. We introduce the problem
of checking the safety of the agenda: for a given agenda, can we
guarantee that judgment aggregation will never produce an inconsistent
outcome for any aggregation procedure satisfying a given set of
axioms? We prove several characterisation results, establishing
necessary and sufficient conditions for the safety of the agenda for
different combinations of the most important axioms proposed in the
literature, and we analyse the computational complexity of checking
whether a given agenda satisfies these conditions.
| Item Type: | Report |
|---|---|
| Report Nr: | PP-2010-02 |
| Series Name: | Prepublication (PP) Series |
| Year: | 2010 |
| Uncontrolled Keywords: | judgment aggregation; computational social choice |
| 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/381 |
Actions (login required)
 |
View Item |
