Concept

Condorcet jury theorem

The result that a majority of independent voters, each right more often than not, is right more often than any one of them. As the group grows the majority is almost surely right, and the theorem fails when the votes are correlated or each voter is more often wrong.

Named by 4 essays across one field — each of them below, with the objects they name alongside it.

A majority of independent voters, more often right than any of them. The probability that a simple majority of n independent voters is right, for n from 1 to 201, when each voter is right with probability 0.45, 0.51, 0.55, 0.6, 0.7.

A majority wiser than its members

Condorcet's other theorem turns voting round: the voters no longer have preferences but judgements about a single fact, each a little more likely right than wrong. Then a simple majority of many of them is almost certainly right — 6,763 voters who are each right 51% of the time make a majority right 95% of the time. The theorem survives voters worse than a coin, if the average is better. It does not survive voters who share their mistakes, and when their skills differ the right rule weighs votes rather than counting them.

applied · Voting rules
How often each procedure finds the right verdict, with 3 judges of competence 0.7. both true: liable: premises 61.5%, conclusion 48.5%; first only: not liable: premises 83.1%, conclusion 88.6%; second only: not liable: premises 83.1%, conclusion 88.6%; neither: not liable: premises 95.3%, conclusion 97.7%; average 80.7% against 80.9%.

Which vote finds the truth more often

A court that must decide two premises and their conjunction can vote on the premises or on the conclusion, and the two votes sometimes disagree. Suppose there is a right answer and each judge is more often right than wrong. Then the question has an exact answer: for three judges the conclusion vote is more often right when competence is below √½ and the premise vote above it, and in a large court the premise vote wins at any competence — while the conclusion vote turns out to be a built-in standard of proof.

applied · Judgement aggregation
How good each judge must be, as the premises multiply. k = 1: 0.5000; k = 2: 0.7071; k = 3: 0.7937; k = 4: 0.8409; k = 5: 0.8706; k = 6: 0.8909; k = 7: 0.9057; k = 8: 0.9170; k = 9: 0.9259; k = 10: 0.9330.

Every premise makes the verdict vote stricter

A court that must find several things true before it finds liability can vote on each of them or on the verdict. With two elements, judges right seven times in ten are enough for either. With five, the verdict vote needs judges right eighty-seven times in a hundred, or a larger court makes it worse — while the premise vote still needs only better than even. And when any one ground is enough instead of all, the two procedures swap their failures.

applied · Judgement aggregation
One weak element drags both procedures down. p1=0.55: premise 0.6331, verdict 0.5607; p1=0.6: premise 0.7535, verdict 0.6834; p1=0.7: premise 0.9218, verdict 0.8754; p1=0.8: premise 0.9883, verdict 0.9717; p1=0.9: premise 0.9997, verdict 0.9978

The element the judges are worst at

A court can vote element by element or on the verdict, and the comparison so far assumed judges equally good at every element. Real judges are surer about the law than about a contested fact. Make one element hard and both procedures sink towards the majority on that element, but they sink differently: the verdict vote sees only the product of the judges' competences and cannot tell an even court from a lopsided one, while the premise vote is ruled by its weakest majority. And when a judge's errors on two elements come from the same misreading of the facts, the gap between the procedures closes.

applied · Judgement aggregation

Named alongside it

The objects these essays reach for when they reach for this one.

Binomial distributionJudgement aggregationMajority ruleCorrelationIndependencePropositionAggregationBayes' theoremBiasLaw of large numbersPairwise majorityProbability

All concepts