Which rules for aggregating judgments on logically connected propositions are manipulable and which not? In this paper, we introduce a preference-free concept of non-manipulability and contrast it with a preference-theoretic concept of strategy-proofness. We characterize all non-manipulable and...

In the theory of judgment aggregation on logically connected propositions, an important question remains open: Which aggregation rules are manipulable and which are strategy-proof? We define manipulability and strategy-proofness in judgment aggregation, characterize all strategy-proof...

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...

The paper attached is the revised 23 April 2010 version.

In judgment aggregation, unlike preference aggregation, not much is known about domain restrictions that guarantee consistent majority outcomes. We introduce several conditions on individual judgments sufficient for consistent majority judgments. Some are based on global orders of propositions...

How can different individuals’ probability assignments to some events be aggregated into a collective probability assignment? Although there are several classic results on this problem, they all assume that the ‘agenda’of relevant events forms a -algebra, an overly demanding assumption for...

All existing impossibility theorems on judgment aggregation over logically connected propositions have one of two restrictions: they either use a controversial systematicity condition or apply only to special agendas of propositions with rich logical connections. An important open question is...

It is known that majority voting among several individuals on logically interconnected propositions may generate irrational collective judgments. We generalize majority voting by considering quota rules, which accept each proposition if and only if the number of individuals accepting it exceeds...

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...