Selected topics in finite mathematics/Voting/Sequential pairwise elections
Objectives[edit | edit source]
To determine a winner using a one on one elimination style until one is left standing.
Details[edit | edit source]
Sequential pairwise voting is very similar to that of Condorcet's method of one on one competition. You take one candidate and pit him against another candidate. You look at the preference list and you identify the places of the votes that the two candidates that are receiving and you add them up and see who is highest. For example, if B and C are going against each other in the one on one, you look at the preference list and see who is above who and give the votes to whoever has the higher placed votes. So if B is above C in the preference list then B gets the votes and vice-versa. Then you eliminate the candidate with the fewest votes and the candidate that won moves on to face another candidate. So let us say B had the higher votes, so C is eliminated and B moves to face D or any other opponent. You keep this process going until one candidate is left.