Aggregation of binary evaluations for truth-functional agendas

Elad Dokow, Ron Holzman

Research output: Contribution to journalArticlepeer-review

26 Scopus citations


In the problem of judgment aggregation, a panel of judges has to evaluate each proposition in a given agenda as true or false, based on their individual evaluations and subject to the constraint of logical consistency. We elaborate on the relation between this and the problem of aggregating abstract binary evaluations. For the special case of truth-functional agendas we have the following main contributions: (1) a syntactical characterization of agendas for which the analogs of Arrow's aggregation conditions force dictatorship; (2) a complete classification of all aggregators that satisfy those conditions; (3) an analysis of the effect of weakening the Pareto condition to surjectivity.

Original languageEnglish
Pages (from-to)221-241
Number of pages21
JournalSocial Choice and Welfare
Issue number2
StatePublished - Feb 2009
Externally publishedYes


Dive into the research topics of 'Aggregation of binary evaluations for truth-functional agendas'. Together they form a unique fingerprint.

Cite this