M.J.A.N. de Caritat, Marquis de Condorcet, studied the problem of determining the most likely correct choice, under voting by a group of decision-makers. In this, his work is closely related to that of J.-Ch. Borda.
In the case of dichotomous choice (two alternatives), Condorcet obtained valuable results (see also Condorcet jury theorem), which have been extended in recent times (as of 2000). For the case of three or more alternatives (candidates), however, serious difficulties occur (see also Social choice).
Briefly, one can say that candidate $A$ defeats candidate $B$ if a majority of the voters prefer $A$ to $B$. With only two candidates, there is little more to say: barring ties (which are assumed to have extremely low probability), one of the two candidates will defeat the other. Where there are three or more candidates, however, cyclic situations might occur, wherein $A$ defeats $B$, who defeats $C$, who in turn defeats $A$. It is of course possible that one candidate defeats all the others; if so, this candidate is said to be the Condorcet winner. However, even if there is a Condorcet winner, standard methods of voting need not produce this winner. This is Condorcet's paradox (cf. also Voting paradoxes).
The easiest method of voting is, of course, straight plurality voting. Another might be two-round voting, with a second round only if there is no majority on the first round.
A third, more sophisticated method, is the following: voters state their first choice. If no candidate has a majority of the votes, then that candidate with the least votes is eliminated, and voters are asked to choose among the remaining candidates. These steps are repeated until one candidate is left with a majority. This method is frequently used in elections.
With any of these three methods, suppose there are three candidates, $A$, $B$ and $C$, and nine voters. Suppose two voters rank the candidates $A$, $B$, $C$; three rank them $B$, $A$, $C$; and four rank them $C$, $A$, $B$. In this case, $C$ would be the winner under straight plurality voting.
For either of the other two methods, $A$ (with only two votes) would be eliminated in the first round; $B$ would then defeat $C$ in the second round. Note, however, that $A$ defeats $B$ by $6$ votes to $3$, and also defeats $C$ by $5$ votes to $4$. Thus $A$, the first eliminated, is the Condorcet winner.
An alternative idea is to count the number of votes that a candidate would have in one-on-one contests against each of the other candidates. This is known as the Borda count (cf. also Voting paradoxes), and Borda suggested that the candidate with highest count should be the winner. Again, the Condorcet winner (if one exists) need not be the Borda winner. As an example, suppose there are three candidates, and $11$ voters, with rankings as follows:
$5$ voters rank $A$, $C$, $B$;
$1$ voter ranks $B$, $A$, $C$;
$2$ voters rank $C$, $A$, $B$;
$3$ voters rank $C$, $B$, $A$. In this case, $A$ defeats both $B$ (by $7$ votes to $4$) and $C$ (by $6$ to $5$). Thus $A$ is the Condorcet winner, and has a Borda count of $13$. However, $C$ defeats $B$ by $10$ votes to $1$, and so $C$'s Borda count is $15$. Thus, $C$ is the Borda winner.
In general, the problem of group decision when there are three or more alternatives leads to contradictions. These are best summarized in the Arrow impossibility theorem, which states (briefly) that there is no method (for such decisions) satisfying certain eminently reasonable axioms.
|[a1]||K.J. Arrow, "Social choice and individual values" , Cowles Commission Monograph , 12 , Wiley (1951)|
|[a2]||J.-Ch. Borda, "Sur la forme des élections au scrutin" Mém. Acad. Royal Sci. Paris (1781/4) pp. 657–665|
|[a3]||N.C. de Condorcet, "Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix" , Paris (1785)|
Condorcet paradox. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Condorcet_paradox&oldid=32777