2.12: So Where’s the Fair Method?
At this point, you’re probably asking why we keep looking at method after method just to point out that they are not fully fair. We must be holding out on the perfect method, right?
Unfortunately, no. A mathematical economist, Kenneth Arrow, was able to prove in 1949 that there is no voting method that will satisfy all the fairness criteria we have discussed.
Arrow’s Impossibility Theorem states, roughly, that it is not possible for a voting method to satisfy every fairness criteria that we’ve discussed.
To see a very simple example of how difficult voting can be, consider the election below:
\(\begin{array}{|l|l|l|l|}
\hline & 5 & 5 & 5 \\
\hline 1^{\text {st }} \text { choice } & \mathrm{A} & \mathrm{C} & \mathrm{B} \\
\hline 2^{\text {nd }} \text { choice } & \mathrm{B} & \mathrm{A} & \mathrm{C} \\
\hline 3^{\text {rd }} \text { choice } & \mathrm{C} & \mathrm{B} & \mathrm{A} \\
\hline
\end{array}\)
Notice that in this election:
- 10 people prefer A to B
- 10 people prefer B to C
- 10 people prefer C to A
No matter whom we choose as the winner, 2/3 of voters would prefer someone else! This scenario is dubbed Condorcet’s Voting Paradox , and demonstrates how voting preferences are not transitive (just because A is preferred over B, and B over C, does not mean A is preferred over C). In this election, there is no fair resolution.
It is because of this impossibility of a totally fair method that Plurality, IRV, Borda Count, Copeland’s Method, and dozens of variants are all still used. Usually the decision of which method to use is based on what seems most fair for the situation in which it is being applied.