Condorcet's Paradox

We propose a new single-winner voting system using ranked ballots: Stable Voting. The motivating principle of Stable Voting is that if a candidate A would win without another candidate B in the election, and A beats B in a head-to-head majority comparison, then A should still win in the election with B included (unless there is another candidate A' who has the same kind of claim to winning, in which case a tiebreaker may choose between such candidates). We call this (...) principle Stability for Winners (with Tiebreaking). Stable Voting satisfies this principle while also having a remarkable ability to avoid tied outcomes in elections even with small numbers of voters. (shrink)

Riker (1982) famously argued that Arrow’s impossibility theorem undermined the logical foundations of “populism”, the view that in a democracy, laws and policies ought to express “the will of the people”. In response, his critics have questioned the use of Arrow’s theorem on the grounds that not all configurations of preferences are likely to occur in practice; the critics allege, in particular, that majority preference cycles, whose possibility the theorem exploits, rarely happen. In this essay, I argue that the critics’ (...) rejoinder to Riker misses the mark even if its factual claim about preferences is correct: Arrow’s theorem and related results threaten the populist’s principle of democratic legitimacy even if majority preference cycles never occur. In this particular context, the assumption of an unrestricted domain is justified irrespective of the preferences citizens are likely to have. (shrink)

In social choice theory with ordinal preferences, a voting method satisfies the axiom of positive involvement if adding to a preference profile a voter who ranks an alternative uniquely first cannot cause that alternative to go from winning to losing. In this note, we prove a new impossibility theorem concerning this axiom: there is no ordinal voting method satisfying positive involvement that also satisfies the Condorcet winner and loser criteria, resolvability, and a common invariance property for Condorcet methods, namely that (...) the choice of winners depends only on the ordering of majority margins by size. (shrink)

We propose a Condorcet-consistent voting method that we call Split Cycle. Split Cycle belongs to the small family of known voting methods satisfying the anti-vote-splitting criterion of independence of clones. In this family, only Split Cycle satisfies a new criterion we call immunity to spoilers, which concerns adding candidates to elections, as well as the known criteria of positive involvement and negative involvement, which concern adding voters to elections. Thus, in contrast to other clone-independent methods, Split Cycle mitigates both “spoiler (...) effects” and “strong no show paradoxes.”. (shrink)

In this paper, we explore the stability of the aggregation procedure of individual preferences. In particular, we propose the stability under the addition of social preference, which is a normative property of democratic collective decision making. We establish impossibility and possibility theorems for non-dictatorial aggregation procedures.

There is a long tradition of fruitful interaction between logic and social choice theory. In recent years, much of this interaction has focused on computer-aided methods such as SAT solving and interactive theorem proving. In this paper, we report on the development of a framework for formalizing voting theory in the Lean theorem prover, which we have applied to verify properties of a recently studied voting method. While previous applications of interactive theorem proving to social choice have focused on the (...) verification of impossibility theorems, we aim to cover a variety of results ranging from impossibility theorems to the verification of properties of specific voting methods. In order to formalize voting theoretic axioms concerning adding or removing candidates and voters, we work in a variable-election setting whose formalization makes use of dependent types in Lean. (shrink)

We propose six axioms concerning when one candidate should defeat another in a democratic election involving two or more candidates. Five of the axioms are widely satisfied by known voting procedures. The sixth axiom is a weakening of Kenneth Arrow's famous condition of the Independence of Irrelevant Alternatives (IIA). We call this weakening Coherent IIA. We prove that the five axioms plus Coherent IIA single out a method of determining defeats studied in our recent work: Split Cycle. In particular, Split (...) Cycle provides the most resolute definition of defeat among any satisfying the six axioms for democratic defeat. In addition, we analyze how Split Cycle escapes Arrow's Impossibility Theorem and related impossibility results. (shrink)

Schwartz [A Procedural Condition Necessary and Sufficient for Cyclic Social Preference, J. Econ. Theory 137 (2007), 688–695] provides a generalization of the voting paradox by using the impotence‐partition condition. This paper aims to clarify his result by providing several remarks. We show that a main result of Schwartz can be strengthened by replacing strong Pareto by weak Pareto. We also discuss how the impotence partition is related to the standard concept of decisiveness, which is widely employed in the literature on (...) social choice. (shrink)

In a democracy, citizens should have some control over how they are governed. If they do not participate directly in making policy, they ought to maintain control over the public officials who design policy on their behalf. Rule by Multiple Majorities develops a novel theory of popular control: an account of what it is, why democracy's promise of popular control is compatible with what we know about actual democracies, and why it matters. While social choice theory suggests there is no (...) such thing as a 'popular will' in societies with at least minimal diversity of opinion, the author argues that multiple, overlapping majorities can nonetheless have control, at the same time. After resolving this conceptual puzzle, the author explains why popular control is a realistic and compelling ideal for democracies, notwithstanding voters' low levels of information and other shortcomings. (shrink)

In normative political theory, it is widely accepted that democracy cannot be reduced to voting alone, but that it requires deliberation. In formal social choice theory, by contrast, the study of democracy has focused primarily on the aggregation of individual opinions into collective decisions, typically through voting. While the literature on deliberation has an optimistic flavour, the literature on social choice is more mixed. It is centred around several paradoxes and impossibility results identifying conflicts between different intuitively plausible desiderata. In (...) recent years, there has been a growing dialogue between the two literatures. This paper discusses the connections between them. Important insights are that (i) deliberation can complement aggregation and open up an escape route from some of its negative results; and (ii) the formal models of social choice theory can shed light on some aspects of deliberation, such as the nature of deliberation-induced opinion change. (shrink)

Among the possible solutions to the paradoxes of collective preferences, single-peakedness is significant because it has been associated to a suggestive conceptual interpretation: a single-peaked preference profile entails that, although individuals may disagree on which option is the best, they conceptualize the choice along a shared unique dimension, i.e. they agree on the rationale of the collective decision. In this article, we discuss the relationship between the structural property of singlepeakedness and its suggested interpretation as uni-dimensionality of a social choice. (...) In particular, we offer a formalization of the relationship between single-peakedness and its conceptual counterpart, we discuss their logical relations, and we question whether single-peakedness provides a rationale for collective choices. (shrink)

In this chapter, I discuss the "common mind thesis" that social integrates have mind of their own – a thesis which is built on a kind of aggregation paradox named doctrinal paradox. External analysis objects its very name: there is no paradox, but non-commutativity of the function composition involved in the aggregation process (Part I). Internal analysis shows that the doctrinal paradox works only when premises are separable. However premises turn out to be hardly separable in the examples cited in (...) the literature (Part II). As the doctrinal paradox is sometimes considered as an argument of holism, its flaws questions the thesis that groups have minds of their own. (shrink)

Kenneth Arrow’s “impossibility” theorem—or “general possibility” theorem, as he called it—answers a very basic question in the theory of collective decision-making. Say there are some alternatives to choose among. They could be policies, public projects, candidates in an election, distributions of income and labour requirements among the members of a society, or just about anything else. There are some people whose preferences will inform this choice, and the question is: which procedures are there for deriving, from what is known or (...) can be found out about their preferences, a collective or “social” ordering of the alternatives from better to worse? The answer is startling. Arrow’s theorem says there are no such procedures whatsoever—none, anyway, that satisfy certain apparently quite reasonable assumptions concerning the autonomy of the people and the rationality of their preferences. The technical framework in which Arrow gave the question of social orderings a precise sense and its rigorous answer is now widely used for studying problems in welfare economics. The impossibility theorem itself set much of the agenda for contemporary social choice theory. Arrow accomplished this while still a graduate student. In 1972, he received the Nobel Prize in economics for his contributions. (shrink)

Majority cycling and related social choice paradoxes are often thought to threaten the meaningfulness of democracy. But deliberation can prevent majority cycles – not by inducing unanimity, which is unrealistic, but by bringing preferences closer to single-peakedness. We present the first empirical test of this hypothesis, using data from Deliberative Polls. Comparing preferences before and after deliberation, we find increases in proximity to single-peakedness. The increases are greater for lower versus higher salience issues and for individuals who seem to have (...) deliberated more versus less effectively. They are not merely a byproduct of increased substantive agreement. Our results both refine and support the idea that deliberation, by increasing proximity to single-peakedness, provides an escape from the problem of majority cycling. (shrink)

Public deliberation has been defended as a rational and noncoercive way to overcome paradoxical results from democratic voting, by promoting consensus on the available alternatives on the political agenda. Some critics have argued that full consensus is too demanding and inimical to pluralism and have pointed out that single-peakedness, a much less stringent condition, is sufficient to overcome voting paradoxes. According to these accounts, deliberation can induce single-peakedness through the creation of a ‘meta-agreement’, that is, agreement on the dimension according (...) to which the issues at stake are ‘conceptualized’. We argue here that once all the conditions needed for deliberation to bring about single-peakedness through meta-agreement are unpacked and made explicit, meta-agreement turns out to be a highly demanding condition, and one that is very inhospitable to pluralism. (shrink)

The impossibility results in judgement aggregation show a clash between fair aggregation procedures and rational collective outcomes. In this paper, we are interested in analysing the notion of rational outcome by proposing a proof-theoretical understanding of collective rationality. In particular, we use the analysis of proofs and inferences provided by linear logic in order to define a fine-grained notion of group reasoning that allows for studying collective rationality with respect to a number of logics. We analyse the well-known paradoxes in (...) judgement aggregation and we pinpoint the reasoning steps that trigger the inconsistencies. Moreover, we extend the map of possibility and impossibility results in judgement aggregation by discussing the case of substructural logics. In particular, we show that there exist fragments of linear logic for which general possibility results can be obtained. (shrink)

This paper provides an introductory review of the theory of judgment aggregation. It introduces the paradoxes of majority voting that originally motivated the field, explains several key results on the impossibility of propositionwise judgment aggregation, presents a pedagogical proof of one of those results, discusses escape routes from the impossibility and relates judgment aggregation to some other salient aggregation problems, such as preference aggregation, abstract aggregation and probability aggregation. The present illustrative rather than exhaustive review is intended to give readers (...) new to the field of judgment aggregation a sense of this rapidly growing research area. (shrink)

Many collective decision making problems have a combinatorial structure: the agents involved must decide on multiple issues and their preferences over one issue may depend on the choices adopted for some of the others. Voting is an attractive method for making collective decisions, but conducting a multi-issue election is challenging. On the one hand, requiring agents to vote by expressing their preferences over all combinations of issues is computationally infeasible; on the other, decomposing the problem into several elections on smaller (...) sets of issues can lead to paradoxical outcomes. Any pragmatic method for running a multi-issue election will have to balance these two concerns. We identify and analyse the problem of generating an agenda for a given election, specifying which issues to vote on together in local elections and in which order to schedule those local elections. (shrink)

Can we design a perfect democratic decision procedure? Condorcet famously observed that majority rule, our paradigmatic democratic procedure, has some desirable properties, but sometimes produces inconsistent outcomes. Revisiting Condorcet’s insights in light of recent work on the aggregation of judgments, I show that there is a conflict between three initially plausible requirements of democracy: “robustness to pluralism”, “basic majoritarianism”, and “collective rationality”. For all but the simplest collective decision problems, no decision procedure meets these three requirements at once; at most (...) two can be met together. This “democratic trilemma” raises the question of which requirement to give up. Since different answers correspond to different views about what matters most in a democracy, the trilemma suggests a map of the “logical space” in which different conceptions of democracy are located. It also sharpens our thinking about other impossibility problems of social choice and how to avoid them, by capturing a core structure many of these problems have in common. More broadly, it raises the idea of “cartography of logical space” in relation to contested political concepts. (shrink)

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 su¢ - cient for consistent majority judgments. Some are based on global orders of propositions or individuals, others on local orders, still others not on orders at all. Some generalize classic social-choice-theoretic domain conditions, others have no counterpart. Our most general condition generalizes Sen’s triplewise value-restriction, itself the most general classic condition. We also prove a (...) new characterization theorem: for a large class of domains, if there exists any aggregation function satisfying some democratic conditions, then majority voting is the unique such function. Taken together, our results provide new support for the robustness of majority rule. (shrink)

This introduces the symposium on judgment aggregation. The theory of judgment aggregation asks how several individuals' judgments on some logically connected propositions can be aggregated into consistent collective judgments. The aim of this introduction is to show how ideas from the familiar theory of preference aggregation can be extended to this more general case. We first translate a proof of Arrow's impossibility theorem into the new setting, so as to motivate some of the central concepts and conditions leading to analogous (...) impossibilities, as discussed in the symposium. We then consider each of four possible escape-routes explored in the symposium. (shrink)

In this paper, I investigate the relationship between preference and judgment aggregation, using the notion of ranking judgment introduced in List and Pettit. Ranking judgments were introduced in order to state the logical connections between the impossibility theorem of aggregating sets of judgments and Arrow’s theorem. I present a proof of the theorem concerning ranking judgments as a corollary of Arrow’s theorem, extending the translation between preferences and judgments defined in List and Pettit to the conditions on the aggregation procedure.

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.

A philosophical dialogue on the functioning, the limits, and the paradoxes of our electoral practices, dealing with such basic questions as: What is a vote? How do we count votes? And do votes really count?

The widely discussed "discursive dilemma" shows that majority voting in a group of individuals on logically connected propositions may produce 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 a given threshold, where different thresholds may be used for different propositions. After characterizing quota rules, we prove necessary and sufficient conditions on the required thresholds for various collective rationality requirements. We also consider sequential (...) quota rules, which ensure collective rationality by adjudicating propositions sequentially and letting earlier judgments constrain later ones. Sequential rules may be path-dependent and strategically manipulable. We characterize path-independence and prove its essential equivalence to strategy-proofness. Our results shed light on the rationality of simple-, super-, and sub-majoritarian decision-making. (shrink)

All existing impossibility theorems on judgment aggregation require individual and collective judgment sets to be consistent and complete, arguably a demanding rationality requirement. They do not carry over to aggregation functions mapping profiles of consistent individual judgment sets to consistent collective ones. We prove that, whenever the agenda of propositions under consideration exhibits mild interconnections, any such aggregation function that is "neutral" between the acceptance and rejection of each proposition is dictatorial. We relate this theorem to the literature.

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)

Suppose a committee or a jury confronts a complex question, the answer to which requires attending to several sub-questions. Two different voting procedures can be used. On one, the committee members vote on each sub-question and the voting results are used as premises for the committee’s conclusion on the main issue. This premise-based procedure can be contrasted with the conclusion-based approach, which requires the members to directly vote on the conclusion, with the vote of each member being guided by her (...) views on the relevant sub-questions. The two procedures are not equivalent: There may be a majority of voters supporting each of the premises, but if these majorities do not significantly overlap, there will be a majority against the conclusion. Pettit (2001) connects the choice between the two procedures with the discussion of deliberative democracy. The problem we want to examine instead concerns the relative advantages and disadvantages of the two procedures from the epistemic point of view. Which of them is better when it comes to tracking truth? As it turns out, the answer is not univocal. On the basis of Condorcet’s jury theorem, the premise-based procedure can be shown to be superior if the objective is reach truth for the right reasons, without making any mistakes on the way. However, if the goal instead is to reach truth for whatever reasons, right or wrong, there will be cases in which using the conclusion-based procedure turns out to be more reliable, even though, for the most part, the premise-based procedure will retain its superiority. (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)

Condorcet’s voting paradox shows that pairwise majority voting may lead to cyclical majority preferences. In a famous paper, Sen identified a general condition on a profile of individual preference orderings, called triplewise value-restriction, which is sufficient for the avoidance of such cycles. This note aims to make Sen’s result easily accessible. We provide an elementary proof of Sen's possibility theorem and a simple reformulation of Sen’s condition. We discuss how Sen’s condition is logically related to a number of precursors. Finally, (...) we state a necessary and sufficient condition for the avoidance of cycles, and suggest that, although there is still some logical space between that condition and Sen’s sufficient condition, Sen’s condition cannot be further generalized in an appealing way. (shrink)

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)

Suppose a committee or a jury confronts a complex question, the answer to which requires attending to several sub-questions. Two different voting procedures can be used. On one, the committee members vote on each sub-question and the voting results are used as premises for the committee’s conclusion on the main issue. This premise-based procedure can be contrasted with the conclusion-based approach, which requires the members to directly vote on the conclusion, with the vote of each member being guided by her (...) views on the relevant sub-questions. The two procedures are not equivalent: There may be a majority of voters supporting each of the premises, but if these majorities do not significantly overlap, there will be a majority against the conclusion. Pettit (2001) connects the choice between the two procedures with the discussion of deliberative democracy. The problem we want to examine instead concerns the relative advantages and disadvantages of the two procedures from the epistemic point of view. Which of them is better when it comes to tracking truth? As it turns out, the answer is not univocal. On the basis of Condorcet’s jury theorem, the premise-based procedure can be shown to be superior if the objective is reach truth for the right reasons, without making any mistakes on the way. However, if the goal instead is to reach truth for whatever reasons, right or wrong, there will be cases in which using the conclusion-based procedure turns out to be more reliable, even though, for the most part, the premise-based procedure will retain its superiority. (shrink)

Jonathan Aldred shares our desire to promote a reconciliation between social choice theory and deliberative democracy in the interests of a more comprehensive and compelling account of democracy.1 His comments on some details of our analysis – specifically, our use of Arrow’s conditions of universal domain and independence of irrelevant alternatives – give us an opportunity to clarify our position. His discussion of the independence condition in particular identifies some ambiguity in our exposition, and as such is useful. We are (...) less impressed by the way Aldred characterizes the overall terms of the reconciliation we propose. We believe that his argument on this matter should be resisted because it provides deliberative democrats with a bad excuse to dismiss social choice theory altogether, which is surely not what he intends. (shrink)

Suppose a committee has to take a stand on a complex issue, where the decision presupposes answering a number of sub-questions. There is an agreement within the committee which sub-questions should be posed. All questions are of the ”yes or no?”-type and the main question is to be given the yes-answer if and only if each sub-question is answered with “yes”. Two different voting procedures can be used. On one procedure, the committee members vote on each sub-question and the voting (...) results then determine the committee’s conclusion on the main issue. This premise-based procedure (or pbp, for short) can be contrasted with the conclusion-based procedure (cbp), on which the members directly vote on the conclusion, with the vote of each member being guided by her views on the relevant sub-questions. The problem we want to examine concerns the relative advantages and disadvantages of the two procedures from the epistemic point of view. In some cases one can assume that the question before the committee has a right answer, which the committee is trying to reach. Is one of the two procedures better when it comes to tracking the truth? As it turns out, the answer to this query is not univocal: On the basis of Condorcet’s jury theorem we shall show that the premise-based procedure is clearly superior if we want to reach truth for the right reasons, i.e. without making any mistakes on the road to the conclusion. However, if the goal instead is to reach truth for whatever reasons, right or wrong, there will be special cases in which using the conclusion-based procedure turns out to be more reliable. But for the most part, the premise-based procedure will still retain its superiority. In this respect, our results disconfirm the tentative conjectures that have been put forward in Pettit and Rabinowicz (2001). (shrink)

Drawing on the so-called “doctrinal paradox”, List and Pettit (2002) have shown that, given an unrestricted domain condition, there exists no procedure for aggregating individual sets of judgments over multiple interconnected propositions into corresponding collective ones, where the procedure satisfies some minimal conditions similar to the conditions of Arrow’s theorem. I prove that we can avoid the paradox and the associated impossibility result by introducing an appropriate domain restriction: a structure condition, called unidimensional alignment, is shown to open up a (...) possibility result, similar in spirit to Black’s median voter theorem. Specifically, I prove that, given unidimensional alignment, propositionwise majority voting is the unique procedure for aggregating individual sets of judgments into collective ones in accordance with the above mentioned minimal conditions. (shrink)

The two most influential traditions of contemporary theorizing about democracy, social choice theory and deliberative democracy, are generally thought to be at loggerheads, in that the former demonstrates the impossibility, instability or meaninglessness of the rational collective outcomes sought by the latter. We argue that the two traditions can be reconciled. After expounding the central Arrow and Gibbard-Satterthwaite impossibility results, we reassess their implications, identifying the conditions under which meaningful democratic decision making is possible. We argue that deliberation can promote (...) these conditions, and hence that social choice theory suggests not that democratic decision making is impossible, but rather that democracy must have a deliberative aspect. (shrink)

Many studies have considered the probability that a pairwise majority rule (PMR) winner exists for three candidate elections. The absence of a PMR winner indicates an occurrence of Condorcet's Paradox for three candidate elections. This paper summarizes work that has been done in this area with the assumptions of: Impartial Culture, Impartial Anonymous Culture, Maximal Culture, Dual Culture and Uniform Culture. Results are included for the likelihood that there is a strong winner by PMR, a weak winner by PMR, and (...) the probability that a specific candidate is among the winners by PMR. Closed form representations are developed for some of these probabilities for Impartial Anonymous Culture and for Maximal Culture. Consistent results are obtained for all cultures. In particular, very different behaviors are observed for odd and even numbers of voters. The limiting probabilities as the number of voters increases are reached very quickly for odd numbers of voters, and quite slowly for even numbers of voters. The greatest likelihood of observing Condorcet's Paradox typically occurs for small numbers of voters. Results suggest that while examples of Condorcet's Paradox are observed, one should not expect to observe them with great frequency in three candidate elections. (shrink)

This paper develops a distinction between "substantive agreement" and "meta-agreement" and explores the significance of this distinction for democracy and social choice.

This item was published as 'Appendix 3: An Implication of the k-option Condorcet jury mechanism for the probability of cycles' in List and Goodin (2001) http://eprints.lse.ac.uk/705/. Standard results suggest that the probability of cycles should increase as the number of options increases and also as the number of individuals increases. These results are, however, premised on a so-called "impartial culture" assumption: any logically possible preference ordering is assumed to be as likely to be held by an individual as any other. (...) The present chapter shows, in the three-option case, that given suitably systematic, however slight, deviations from an impartial culture situation, the probability of a cycle converges either to zero (more typically) or to one (less typically) as the number of individuals increases. (shrink)

Within the context of coalition behaviour, proving sources of rationality is one of the main problems in explaining the foundations of cooperative games. Coalitions appear because winnings are super-additive. However, people with rational behaviour choose strategies with under-additive winnings, because winnings and monitoring costs increase with the number of members in the coalition. We need to understand how coalitions are formed. The Jury theorem could be a solution to enable us to understand how groups are formed. Nevertheless, within this theorem (...) two of his arguments are paradoxal. This paper aims to research the compatibility between the Jury theorem and Condorcet's paradox in order to understand how coalitions are formed in the Games theory. (shrink)

May's Theorem [K. O. May, Econometrica 20 (1952) 680-684] characterizes majority voting on two alternatives as the unique preferential voting method satisfying several simple axioms. Here we show that by adding some desirable axioms to May's axioms, we can uniquely determine how to vote on three alternatives. In particular, we add two axioms stating that the voting method should mitigate spoiler effects and avoid the so-called strong no show paradox. We prove a theorem stating that any preferential voting method satisfying (...) our enlarged set of axioms, which includes some weak homogeneity and preservation axioms, agrees with Minimax voting in all three-alternative elections, except perhaps in some improbable knife-edged elections in which ties may arise and be broken in different ways. (shrink)