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

The new field of judgment aggregation aims to find collective judgments on logically interconnected propositions. Recent impossibility results establish limitations on the possibility to vote independently on the propositions. I show that, fortunately, the impossibility results do not apply to a...

If a group is modelled as a single Bayesian agent, what should its beliefs be? I propose an axiomatic model that connects group beliefs to beliefs of group members, who are themselves modelled as Bayesian agents and, crucially, may have different information. They may also have different prior...

If a group is modelled as a single Bayesian agent, what should its beliefs be? I propose an axiomatic model that connects group beliefs to beliefs of the group members. The group members may have different information, different prior beliefs and even different domains (algebras) within which...

In the framework of judgment aggregation, we assume that some formulas of the agenda are singled out as premisses, and that both Independence (formula-wise aggregation) and Unanimity Preservation hold for them. Whether premiss-based aggregation thus defined is compatible with conclusion-based...

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