A Short Introduction to Computational Social Choice
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Applications of logic in social choice theory
CLIMA'11 Proceedings of the 12th international conference on Computational logic in multi-agent systems
Ontology merging as social choice
CLIMA'11 Proceedings of the 12th international conference on Computational logic in multi-agent systems
How hard is it to bribe the judges? a study of the complexity of bribery in judgment aggregation
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
Binary aggregation with integrity constraints
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Introduction to judgment aggregation
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Complexity of judgment aggregation
Journal of Artificial Intelligence Research
A proof-theoretical view of collective rationality
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.01 |
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.