4,236
edits
(what BPW stands for; updated info on generalization) |
(Starting to make this suitable for English Wikipedia) |
||
Line 1:
'''
== Notes ==
Stensholt suggests defining
Kevin Venzke suggests generalizing the method using a modification of the chain climbing mechanism of e.g. [[TACC]]. Initialize an empty set. Consider each candidate in order of descending first preference count. When a candidate pairwise defeats all (if any) candidates currently in the set, then add them to the set. The last candidate who can be added to the set is elected. This agrees with BPW in the three-candidate case since, in the absence of pairwise ties, the winner is always either the Condorcet winner or the candidate of the cycle who pairwise beats the first preference count winner.
|