Condorcet's jury theorem

Condorcet's jury theorem is a political science theorem about the relative probability of a given group of individuals arriving at a correct decision. The theorem was first expressed by the Marquis de Condorcet in his 1785 work Essay on the Application of Analysis to the Probability of Majority Decisions.^[1]

The assumptions of the simplest version of the theorem are that a group wishes to reach a decision by majority vote. One of the two outcomes of the vote is correct, and each voter has an independent probability p of voting for the correct decision. The theorem asks how many voters we should include in the group. The result depends on whether p is greater than or less than 1/2:

If p is greater than 1/2 (each voter is more likely to vote correctly), then adding more voters increases the probability that the majority decision is correct. In the limit, the probability that the majority votes correctly approaches 1 as the number of voters increases.
On the other hand, if p is less than 1/2 (each voter is more likely to vote incorrectly), then adding more voters makes things worse: the optimal jury consists of a single voter.

Proof

To avoid the need for a tie-breaking rule, we assume n is odd. Essentially the same argument works for even n if ties are broken by fair coin-flips.

Now suppose we start with n voters, and let m of these voters vote correctly.

Consider what happens when we add two more voters (to keep the total number odd). The majority vote changes in only two cases:

m was one vote too small to get a majority of the n votes, but both new voters voted correctly.
m was just equal to a majority of the n votes, but both new voters voted incorrectly.

The rest of the time, either the new votes cancel out, only increase the gap, or don't make enough of a difference. So we only care what happens when a single vote (among the first n) separates a correct from an incorrect majority.

Restricting our attention to this case, we can imagine that the first n-1 votes cancel out and that the deciding vote is cast by the n-th voter. In this case the probability of getting a correct majority is just p. Now suppose we send in the two extra voters. The probability that they change an incorrect majority to a correct majority is (1-p)p², while the probability that they change a correct majority to an incorrect majority is p(1-p)(1-p). The first of these probabilities is greater than the second if and only if p > 1/2, proving the theorem.

Asymptotics

The probability of a correct majority decision P(n,p), when the individual probability p is close to 1/2 grows linearly in terms of p-1/2. For n voters each one having probability p of deciding correctly and for odd n (where there are no possible ties):

$P(n,p) = 1/2 + c_1 (p-1/2) + c_3 (p-1/2)^3 + O( (p-1/2)^5 )$

where

$c_1 = {n \choose { \lfloor n/2 \rfloor}} \frac{ \lfloor n/2 \rfloor +1} { 4^{\lfloor n/2 \rfloor}} = \sqrt{ \frac{2n+1}{\pi}} (1 + \frac{1}{16n^2} + O(n^{-3}) )$

and the asymptotic approximation in terms of n is very accurate. The expansion is only in odd powers and $c_3 < 0$ . In simple terms, this says that when the decision is difficult (p close to 1/2), the gain by having n voters grows proportionally to $\sqrt{n}$ .

Limitations

This version of the theorem is correct, given its assumptions, but its assumptions are unrealistic in practice. Some objections that are commonly raised:

Real votes are not independent, and do not have uniform probabilities. This is not necessarily a problem as long as each voter is more likely than not to produce a correct vote, and subsequent work^[2] has considered the case of correlated votes. One very strong version of the theorem requires only that the average of the individual competence levels of the voters (i.e. the average of their individual probabilities of deciding correctly) is slightly greater than half.^[3] This version of the theorem does not require voter independence, but takes into account the degree to which votes may be correlated.^[4]
The notion of "correctness" may not be meaningful when making policy decisions as opposed to deciding questions of fact. Some defenders of the theorem hold that it is applicable when voting is aimed at determining which policy best promotes the public good, rather than at merely expressing individual preferences. On this reading, what the theorem says is that although each member of the electorate may only have a vague perception of which of two policies is better, majority voting has an amplifying effect. The "group competence level", as represented by the probability that the majority chooses the better alternative, increases towards 1 as the size of the electorate grows assuming that each voter is more often right than wrong.
The theorem doesn't directly apply to decisions between more than two outcomes. This critical limitation was in fact recognized by Condorcet (see Condorcet's paradox), and in general it is very difficult to reconcile individual decisions between three or more outcomes (see Arrow's theorem), although List and Goodin present evidence to the contrary.^[5] This limitation may also be overcome by means of a sequence of votes on pairs of alternatives, as is commonly realized via the legislative amendment process. (However, as per Arrow's theorem, this creates a "path dependence" on the exact sequence of pairs of alternatives; e.g., which amendment is proposed first can make a difference in what amendment is ultimately passed, or if the law—with or without amendments—is passed at all.)
The behaviour that everybody in the jury votes according to his own beliefs might not be a Nash equilibrium under certain circumstances.^[6]

Nonetheless, Condorcet's jury theorem provides a theoretical basis for democracy, even if somewhat idealized, as well as a basis of the decision of questions of fact by jury trial, and as such continues to be studied by political scientists.

Notes

↑ Marquis de Condorcet. "Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix" (PNG) (in French). Retrieved 2008-03-10.
↑ see for example: Krishna K. Ladha (August 1992). "The Condorcet Jury Theorem, Free Speech, and Correlated Votes". American Journal of Political Science 36 (3): 617–634. doi:10.2307/2111584. JSTOR 2111584.
↑ Bernard Grofman; Guillermo Owen; Scott L. Feld (1983). "Thirteen theorems in search of the truth." (PDF). Theory & Decision 15 (3): 261-78. doi:10.1007/BF00125672.
↑ James Hawthorne. "Voting In Search of the Public Good: the Probabilistic Logic of Majority Judgments" (PDF). Retrieved 2009-04-20.
↑ Christian List and Robert Goodin (September 2001). "Epistemic democracy : generalizing the Condorcet Jury Theorem" (PDF). Journal of Political Philosophy 9 (3): 277–306. doi:10.1111/1467-9760.00128.
↑ Austen-Smith, David; Banks, Jeffrey S. (1996). "Information aggregation, rationality, and the Condorcet Jury Theorem". American Political Science Review 90 (1): 34–45. doi:10.2307/2082796. JSTOR 2082796.

This article is issued from Wikipedia - version of the Tuesday, February 02, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.