Theory of Voting


Fairness Criteria Theorem : Plurality Voting, Single Runoff, Sequential Runoff, Borda Count and the Condorcet Method satisfy the Monotonicity Criterion.

Example 1 again:


Problem 1:  For the following preference schedule find the winner by Borda count:

A B
B C
C A
11 10

Is there a Majority winner of first place votes?


Problem 2: determine the Condorcet winner. Is the Irrelevant Alternatives Criterion satisfied?
First A A E C D
Second E C B B B
Third C D A A A
Fourth D E C D E
Fifth B B D E C
1 1 1 1 1


Arrows Impossibility Theorem:  No voting system can satisfy all four fairness criteria in all cases.

A weak version of Arrows Impossibility Theorem:
Given an odd number of voters and 3 or more candidates and an election. Then there is no voting system that satisfies both the Condorcet Criterion and the Irrelevant Alternatives Criterion and that produces at least one winner.

Proof: Given the election:
First A B C
Second B C A
Third C A B
1 1 1

A is a non winner, so drop B, then A is still a non winner.
B is a non winner, so drop C, then B is still a non winner.
C is a non winner, so drop A, then C is still a non winner.
So no winner.

Approval votingmight give fairer results more often than traditional methods.

Voting Power