This paper studies a class of judgment aggregation rules, to be called `scoring rules' after their famous counterpart in preference aggregation theory. A scoring rule delivers the collective judgments which reach the highest total `score' across the individuals, subject to the judgments having...

In response to recent work on the aggregation of individual judgments on logically connected propositions into collective judgments, it is often asked whether judgment aggregation is a special case of Arrowian preference aggregation. We argue the op- posite. After proving a general impossibility...

This paper studies a class of judgment aggregation rules, to be called `scoring rules' after their famous counterpart in preference aggregation theory. A scoring rule delivers the collective judgments which reach the highest total `score' across the individuals, subject to the judgments having...

This article gives a brief and informal introduction to the theory of judgment aggregation and to the discursive dilemma, focusing on methodology and interpretation.

This paper studies a class of judgment aggregation rules, to be called `scoring rules' after their famous counterpart in preference aggregation theory. A scoring rule delivers the collective judgments which reach the highest total `score' across the individuals, subject to the judgments having...

The contemporary theory of epistemic democracy often draws on the Condorcet Jury Theorem to formally justify the `wisdom of crowds'. But this theorem is inapplicable in its current form, since one of its premises -- voter independence -- is notoriously violated. This premise carries...

This paper studies a class of judgment aggregation rules, to be called 'scoring rules' after their famous counterpart in preference aggregation theory. A scoring rule delivers the collective judgments which reach the highest total 'score' across the individuals, subject to the judgments having...

When individual judgments ('yes' or 'no') on some propositions are aggregated into collective judgments, the agenda setter can sometimes reverse a collective judgment by changing the set of propositions under consideration (the agenda). I define different kinds of agenda manipulation, and...

How can different individuals' probability assignments to some events be aggregated into a collective probability assignment? Classic results on this problem assume that the set of relevant events -- the agenda -- is a σ-algebra and is thus closed under disjunction (union) and conjunction...

How can different individuals' probability functions on a given σ-algebra of events be aggregated into a collective probability function? Classic approaches to this problem often require `event-wise independence': the collective probability for each event should depend only on the individuals'...