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

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

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

We analyze the problem of aggregating judgments over multiple issues from the perspective of whether aggregate judgments manage to efficiently use all voters' private information. While new in judgment aggregation theory, this perspective is familiar in a different body of literature about...