This paper generalises the classical Condorcet jury theorem from majority voting over two options to plurality voting over multiple options. The paper further discusses the debate between epistemic and procedural democracy and situates its formal results in that debate. The paper finally compares a number of different social choice procedures for many-option choices in terms of their epistemic merits. An appendix explores the implications of some of the present mathematical results for the question of how probable majority cycles (as in (...) Condorcet's paradox) are in large electorates. (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)

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)

Wulf Gaertner provides a comprehensive account of an important and complex issue within social choice theory: how to establish a social welfare function while restricting the spectrum of individual preferences in a sensible way. Gaertner's starting point is K. J. Arrow's famous 'Impossibility Theorem', which showed that no welfare function could exist if an unrestricted domain of preferences is to be satisfied together with some other appealing conditions. A number of leading economists have tried to provide avenues out of this (...) 'impossibility' by restricting the variety of preferences: here, Gaertner provides a clear and detailed account, using standardized mathematical notation, of well over forty theorems associated with domain conditions. Domain Conditions in Social Choice Theory will be an essential addition to the library of social choice theory for scholars and their advanced graduate students. (shrink)

The literature on the theory of social choice has grown considerably beyond the few items in existence at the time the first edition of this book appeared in 1951. Some of the new literature has dealt with the technical, mathematical aspects, more with the interpretive. My own thinking has also evolved somewhat, although I remain far from satisfied with present formulations. The exhaustion of the first edition provides a convenient time for a selective and personal stocktaking in the form of (...) an appended commentary entitled, 'Notes on the Theory of Social Choice, 1963, ' containing reflections on the text and its omissions and on some of the more recent literature. This form has seemed more appropriate than a revision of the original text, which has to some extent acquired a life of its own. (shrink)

The combination 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 in which 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 doctrinal paradox. The doctrinal paradox 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 knowledge 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)

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)