The aggregation of individual judgments on logically interconnected propositions into a collective decision on the same propositions is called judgment aggregation. Literature in social choice and political theory has claimed that judgment aggregation raises serious concerns. For example, consider a set of premises and a conclusion where the latter is logically equivalent to the former. When majority voting is applied to some propositions (the premises) it may give a different outcome than majority voting applied to another set of propositions (the (...) conclusion). This problem is known as the discursive dilemma (or paradox). The discursive dilemma is a serious problem since it is not clear whether a collective outcome exists in these cases, and if it does, what it is like. Moreover, the two suggested escape-routes from the paradox—the so-called premise-based procedure and the conclusion-based procedure—are not, as I will show, satisfactory methods for group decision-making. In this paper I introduce a new aggregation procedure inspired by an operator defined in artificial intelligence in order to merge belief bases. The result is that we do not need to worry about paradoxical outcomes, since these arise only when inconsistent collective judgments are not ruled out from the set of possible solutions. (shrink)

Can groups be rational agents over and above their individual members? We argue that group agents are distinguished by their capacity to mimic the way in which individual agents act and that this capacity must “supervene” on the group members' contributions. But what is the nature of this supervenience relation? Focusing on group judgments, we argue that, for a group to be rational, its judgment on a particular proposition cannot generally be a function of the members' individual judgments on that (...) proposition. Rather, it must be a function of their individual sets of judgments across many propositions. So knowing what the group members individually think about some proposition does not generally tell us how the group collectively adjudicates that proposition: the supervenience relation must be “setwise,” not “proposition‐wise.” Our account preserves the individualistic view that group agency is nothing mysterious but also suggests that a group agent may hold judgments that are not directly continuous with its members' corresponding individual judgments. (shrink)

Logical puzzles like the doctrinal paradox raise the problem of how to aggregate individual judgements into a collective judgement, or alternatively, how to merge collectively inconsistent knowledge bases. In this paper, we view judgement aggregation as a function on propositional logic valuations, and we investigate how logic constrains judgement aggregation. In particular, we show that there is no non-dictatorial decision method for aggregating sets of judgements in a logically consistent way if the decision method is local, i.e., only depends on (...) the individual judgements on the proposition under consideration. (shrink)

We discuss the relationships between positional rules (such as plurality and approval voting as well as the Borda count), Dodgson’s, Kemeny’s and Litvak’s methods of reaching consensus. The discrepancies between methods are seen as results of different intuitive conceptions of consensus goal states and ways of measuring distances therefrom. Saari’s geometric methodology is resorted to in the analysis of the consensus reaching methods.

I present an original model in judgment aggregation theory that demonstrates the general impossibility of consistently describing decision-making purely at the group level. Only a type of unanimity rule can guarantee a group decision is consistent with supporting reasons, and even this possibility is limited to a small class of reasoning methods. The key innovation is that this result holds when individuals can reason in different ways, an allowance not previously considered in the literature. This generalizes judgment aggregation to subjective (...) decision situations, implying that the discursive dilemma persists without individual agreement on the logical constraints. Notably, the model mirrors the typical method of choosing political representatives, and thus suggests that no voting procedure other than unanimity rule can guarantee representation that reflects electorate opinion. Finally, I apply the results to a normative argument for unanimity rule in contract theory and juries, as well as to problems posed for deliberative democratic theory and the concept of representation. (shrink)

Suppose the members of a group (e.g., committee, jury, expert panel) each form a judgment on which worlds in a given set are possible, subject to the constraint that at least one world is possible but not all are. The group seeks to aggregate these individual judgments into a collective judgment, subject to the same constraint. I show that no judgment aggregation rule can solve this problem in accordance with three conditions: “unanimity,” “independence” and “non-dictatorship,” Although the result is a (...) variant of an existing theorem on “group identification” (Kasher and Rubinstein, Logique et Analyse 160:385–395, 1997), the aggregation of judgments on which worlds are possible (or permissible, desirable, etc.) appears not to have been studied yet. The result challenges us to take a stance on which of its conditions to relax. (shrink)

Political theorists have offered many accounts of collective decision-making under pluralism. I discuss a key dimension on which such accounts differ: the importance assigned not only to the choices made but also to the reasons underlying those choices. On that dimension, different accounts lie in between two extremes. The ‘minimal liberal account’ holds that collective decisions should be made only on practical actions or policies and that underlying reasons should be kept private. The ‘comprehensive deliberative account’ stresses the importance of (...) giving reasons for collective decisions, where such reasons should also be collectively decided. I compare these two accounts on the basis of a formal model developed in the growing literature on the ‘discursive dilemma’ and ‘judgment aggregation’ and address several questions: What is the trade-off between the (minimal liberal) demand for reaching agreement on outcomes and the (comprehensive deliberative) demand for reason-giving? How large should the ‘sphere of public reason’ be? When do the decision procedures suggested by the two accounts agree and when not? How good are these procedures at truthtracking on factual matters? What strategic incentives do they generate for decision-makers? My discussion identifies what is at stake in the choice between minimal liberal and comprehensive deliberative accounts of collective decisionmaking, and sheds light not only on these two ideal-typical accounts themselves, but also on many characteristics that intermediate accounts share with them. (shrink)

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 all strategy-proof judgment aggregation rules and prove an impossibility theorem similar to the Gibbard--Satterthwaite theorem. We also discuss weaker forms of non-manipulability and strategy-proofness. Comparing two frequently discussed aggregation rules, we show that “conclusion-based voting” is less vulnerable to manipulation than “premise-based voting”, (...) which is strategy-proof only for “reason-oriented” individuals. Surprisingly, for “outcome-oriented” individuals, the two rules are strategically equivalent, generating identical judgments in equilibrium. Our results introduce game-theoretic considerations into judgment aggregation and have implications for debates on deliberative democracy. (shrink)

The ``doctrinal paradox'' or ``discursive dilemma'' shows that propositionwise majority voting over the judgments held by multiple individuals on some interconnected propositions can lead to inconsistent collective judgments on these propositions. List and Pettit (2002) have proved that this paradox illustrates a more general impossibility theorem showing that there exists no aggregation procedure that generally produces consistent collective judgments and satisfies certain minimal conditions. Although the paradox and the theorem concern the aggregation of judgments rather than preferences, they invite comparison (...) with two established results on the aggregation of preferences: the Condorcet paradox and Arrow's impossibility theorem. We may ask whether the new impossibility theorem is a special case of Arrow's theorem, or whether there are interesting disanalogies between the two results. In this paper, we compare the two theorems, and show that they are not straightforward corollaries of each other. We further suggest that, while the framework of preference aggregation can be mapped into the framework of judgment aggregation, there exists no obvious reverse mapping. Finally, we address one particular minimal condition that is used in both theorems – an independence condition – and suggest that this condition points towards a unifying property underlying both impossibility results. (shrink)

Suppose that the members of a group each hold a rational set of judgments on some interconnected questions, and imagine that the group itself has to form a collective, rational set of judgments on those questions. How should it go about dealing with this task? We argue that the question raised is subject to a difficulty that has recently been noticed in discussion of the doctrinal paradox in jurisprudence. And we show that there is a general impossibility theorem that that (...) difficulty illustrates. Our paper describes this impossibility result and provides an exploration of its significance. The result naturally invites comparison with Kenneth Arrow's famous theorem (Arrow, 1963 and 1984; Sen, 1970) and we elaborate that comparison in a companion paper (List and Pettit, 2002). The paper is in four sections. The first section documents the need for various groups to aggregate its members' judgments; the second presents the discursive paradox; the third gives an informal statement of the more general impossibility result; the formal proof is presented in an appendix. The fourth section, finally, discusses some escape routes from that impossibility. (shrink)

We propose in this paper a new family of belief merging operators, that is based on a game between sources : until a coherent set of sources is reached, at each round a contest is organized to find out the weakest sources, then those sources has to concede. This idea leads to numerous new interesting operators and opens new perspectives for belief merging. Some existing operators are also recovered as particular cases. Those operators can be seen as a special case (...) of Booth's Belief Negotiation Models [BOO 02], but the achieved restriction forms a consistent family of merging operators that worths to be studied on its own. (shrink)

This paper provides a distance based analysis of the Borda rule with respect to Condorcet’s criterion. It shows that the minimal Condorcet consistency present in the Borda rule, whenever a Condorcet winner (the alternative that wins against every other alternative in a pairwise contest) exists, disappears in the case of voting cycles. First, it is shown that for certain preference profiles the Borda winner is furthest from being a Condorcet winner. Second, it is shown that there exist preference profiles for (...) which the Borda winner is closest from being a Condorcet loser (the alternative that loses against every other alternative in a pairwise contest). (shrink)

This paper concerns voting with logical consequences, which means that anybody voting for an alternative x should vote for the logical consequences of x as well. Similarly, the social choice set is also supposed to be closed under logical consequences. The central result of the paper is that, given a set of fairly natural conditions, the only social choice functions that satisfy social logical closure are oligarchic (where a subset of the voters are decisive for the social choice). The set (...) of conditions needed for the proof include a version of Independence of Irrelevant Alternatives that also plays a central role in Arrow's impossibility theorem. (Published Online July 11 2006) Footnotes1 Much of this article was written while the author was a fellow at the Swedish Collegium for Advanced Study in the Social Sciences (SCASSS) in Uppsala. I want to thank the Collegium for providing me with excellent working conditions. Wlodek Rabinowicz and other fellows gave me valuable comments at a seminar at SCASSS when an early version of the paper was presented. I also want to thank Luc Bovens, Franz Dietrich, Christian List and an anonymous referee for their excellent comments on a later version. The final version was prepared during a stay at Oxford University for which I am grateful to the British Academy. (shrink)

This paper addresses a problem for theories of epistemic democracy. In a decision on a complex issue which can be decomposed into several parts, a collective can use different voting procedures: Either its members vote on each sub-question and the answers that gain majority support are used as premises for the conclusion on the main issue, or the vote is conducted on the main issue itself. The two procedures can lead to different results. We investigate which of these procedures is (...) better as a truth-tracker, assuming that there exists a true answer to be reached. On the basis of the Condorcet jury theorem, we show that the pbp is universally superior if the objective is to reach truth for the right reasons. If one instead is after truth for whatever reasons, right or wrong, there will be cases in which the cbp is more reliable, even though, for the most part, the pbp still is to be preferred. (shrink)

This paper addresses a problem for theories of epistemic democracy. In a decision on a complex issue which can be decomposed into several parts, a collective can use different voting procedures: Either its members vote on each sub-question and the answers that gain majority support are used as premises for the conclusion on the main issue, or the vote is conducted on the main issue itself. The two procedures can lead to different results. We investigate which of these procedures is (...) better as a truth-tracker, assuming that there exists a true answer to be reached. On the basis of the Condorcet jury theorem, we show that the pbp is universally superior if the objective is to reach truth for the right reasons. If one instead is after truth for whatever reasons, right or wrong, there will be cases in which the cbp is more reliable, even though, for the most part, the pbp still is to be preferred. (shrink)

According to a theorem recently proved in the theory of logical aggregation, any nonconstant social judgment function that satisfies independence of irrelevant alternatives (IIA) is dictatorial. We show that the strong and not very plausible IIA condition can be replaced with a minimal independence assumption plus a Pareto-like condition. This new version of the impossibility theorem likens it to Arrow’s and arguably enhances its paradoxical value.

The determination of “who is a J” within a society is treated as an aggregation of the views of the members of the society regarding this question. Methods, similar to those used in Social Choice theory are applied to axiomatize three criteria for determining who is a J: 1) a J is whoever defines oneself to be a J. 2) a J is whoever a “dictator” determines is a J. 3) a J is whoever an “oligarchy” of individuals agrees is (...) a J. (shrink)

Our aim in this survey article is to provide an accessible overview of some key results and questions in the theory of judgment aggregation. We omit proofs and technical details, focusing instead on concepts and underlying ideas.

Many groups make decisions over multiple interconnected propositions. The “doctrinal paradox” or “discursive dilemma” shows that propositionwise majority voting can generate inconsistent collective sets of judgments, even when individual sets of judgments are all consistent. I develop a simple model for determining the probability of the paradox, given various assumptions about the probability distribution of individual sets of judgments, including impartial culture and impartial anonymous culture assumptions. I prove several convergence results, identifying when the probability of the paradox converges to (...) 1, and when it converges to 0, as the number of individuals increases. Drawing on the Condorcet jury theorem and work by Bovens and Rabinowicz , I use the model to assess the “truth-tracking” performance of two decision procedures, the premise- and conclusion-based procedures. I compare the present results with existing results on the probability of Condorcet’s paradox. I suggest that the doctrinal paradox is likely to occur under plausible conditions. (shrink)

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 for the converse claim. After proving two impossibility theorems on judgment aggregation (using "systematicity" and "independence" conditions, respectively), we construct an embedding of preference aggregation into judgment aggregation and prove Arrow’s theorem (stated for strict preferences) as a corollary of our second result. Although we thereby (...) provide a new proof of Arrow’s theorem, our main aim is to identify the analogue of Arrow’s theorem in judgment aggregation, to clarify the relation between judgment and preference aggregation, and to illustrate the generality of the judgment aggregation model. JEL Classi…cation: D70, D71.. (shrink)

The new field of judgment aggregation aims to merge many individual sets of judgments on logically interconnected propositions into a single collective set of judgments on these propositions. Judgment aggregation has commonly been studied using classical propositional logic, with a limited expressive power and a problematic representation of conditional statements ("if P then Q") as material conditionals. In this methodological paper, I present a simple unified model of judgment aggregation in general logics. I show how many realistic decision problems can (...) be represented in it. This includes decision problems expressed in languages of classical propositional logic, predicate logic (e.g. preference aggregation problems), modal or conditional logics, and some multi-valued or fuzzy logics. I provide a list of simple tools for working with general logics, and I prove impossibility results that generalise earlier theorems. (shrink)

The aggregation of individual judgments over interrelated propositions is a newly arising field of social choice theory. I introduce several independence conditions on judgment aggregation rules, each of which protects against a specific type of manipulation by agenda setters or voters. I derive impossibility theorems whereby these independence conditions are incompatible with certain minimal requirements. Unlike earlier impossibility results, the main result here holds for any (non-trivial) agenda. However, independence conditions arguably undermine the logical structure of judgment aggregation. I therefore (...) suggest restricting independence to premises, which leads to a generalised premise-based procedure. This procedure is proven to be possible if the premises are logically independent. (shrink)

Several recent results on the aggregation of judgments over logically connected propositions show that, under certain conditions, dictatorships are the only propositionwise aggregation functions generating fully rational (i.e., complete and consistent) collective judgments. A frequently mentioned route to avoid dictatorships is to allow incomplete collective judgments. We show that this route does not lead very far: we obtain oligarchies rather than dictatorships if instead of full rationality we merely require that collective judgments be deductively closed, arguably a minimal condition of (...) rationality, compatible even with empty judgment sets. We derive several characterizations of oligarchies and provide illustrative applications to Arrowian preference aggregation and Kasher and Rubinsteinís group identification problem. (shrink)