Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/43814 
Year of Publication: 
2009
Series/Report no.: 
Working Papers No. 414
Publisher: 
Bielefeld University, Institute of Mathematical Economics (IMW), Bielefeld
Abstract: 
The theory of Boolean algebras can be fruitfully applied to judgment aggregation: Assuming universality, systematicity and a sufficiently rich agenda, there is a correspondence between (i) non-trivial deductively closed judgment aggregators and (ii) Boolean algebra homomorphisms defined on the power-set algebra of the electorate. Furthermore, there is a correspondence between (i) consistent complete judgment aggregators and (ii) 2-valued Boolean algebra homomorphisms defined on the power-set algebra of the electorate. Since the shell of such a homomorphism equals the set of winning coalitions and since (ultra)filters are shells of (2-valued) Boolean algebra homomorphisms, we suggest an explanation for the effectiveness of the (ultra)filter method in social choice theory. From the (ultra)filter property of the set of winning coalitions, one obtains two general impossibility theorems for judgment aggregation on finite electorates, even without the Pareto principle.
Subjects: 
Judgment aggregation
Systematicity
Impossibility theorems
Filter
Ultrafilter
Boolean algebra homomorphism
Persistent Identifier of the first edition: 
Document Type: 
Working Paper

Files in This Item:
File
Size
215.59 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.