|
To determine the winner:
# Eliminate any candidate that is defeated in a one-to-one match with any other higher-approved candidate. SoSuch bya 2 different measures, adefeat definiteis majoritycalled agreesan thatApproval-consistent candidateor should[http://wiki.electorama.com/wiki/Techniques_of_method_design#Defeats_and_defeat_strength bedefinitive eliminateddefeat].
#If more than one candidate remains, the winner is the single candidate that defeats all others in one-to-one (pairwise)contests.
A simple way to implement this is to permute the pairwise array so that candidates are listed in order of approval.
Then, starting with the diagonal cell corresponding to the least-approved candidate, examine all the cells in the column above the diagonal. If the candidate loses to any higher-approved candidates, proceed up the diagonal to the approval rating of the next-higher-approved candidate.
The winner is the first candidate found with no losses to higher-approved candidates.
''Can this be made clearer? --[[User:Araucaria|Araucaria]] 15:05, 21 Mar 2005 (PST)''
=== Handling Ties and Near Ties ===
| 