Endriss, Ulle, Grandi, Umberto, De Haan, Ronald and Lang, Jérôme (2016) Succinctness of Languages for Judgment Aggregation. In: 15th International Conference on Principles of Knowledge Representation and Reasoning (KR 2016), co-located with DL 2016 and NMR 2016.

[thumbnail of 12851-57543-1-PB.pdf]
Download (568kB) | Preview


We review several different languages for collective decision making problems, in which agents express their judgments, opinions, or beliefs over elements of a logically structured domain. Several such languages have been proposed in the literature to compactly represent the questions on which the agents are asked to give their views. In particular, the framework of judgment aggregation allows agents to vote directly on complex, logically related formulas, whereas the setting of binary aggregation asks agents to vote on propositional variables, over which dependencies are expressed by means of an integrity constraint. We compare these two languages and some of their variants according to their relative succinctness and according to the computational complexity of aggregating several individual views expressed in such languages into a collective judgment. Our main finding is that the formula-based language of judgment aggregation is more succinct than the constraint-based language of binary aggregation. In many (but not all) practically relevant situations, this increase in succinctness does not entail an increase in complexity of the corresponding problem of computing the outcome of an aggregation rule.

Item Type: Conference or Workshop Item (Paper)
Language: French
Date: 2016
Uncontrolled Keywords: Social choice theory - Combinatorial domains - Computational complexity
Divisions: Institut de Recherche en Informatique de Toulouse
Site: UT1
Date Deposited: 14 Mar 2019 14:04
Last Modified: 02 Apr 2021 15:59
URI: https://publications.ut-capitole.fr/id/eprint/29016
View Item


Downloads per month over past year