Aggregation of binary evaluations
We study a general aggregation problem in which a society has to determine its position (yes/no) on each of several issues, based on the positions of the members of the society on those issues. There is a prescribed set of feasible evaluations, i.e., permissible combinations of positions on the issues. This framework for the theory of aggregation was introduced by Wilson and further developed by Rubinstein and Fishburn. Among other things, it admits the modeling of preference aggregation (where the issues are pairwise comparisons and feasibility reflects rationality), and of judgment aggregation (where the issues are propositions and feasibility reflects logical consistency). We characterize those sets of feasible evaluations for which the natural analogue of Arrow's impossibility theorem holds true in this framework.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:145:y:2010:i:2:p:495-511. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.