|
Procedure
Suppose d[V,W] is the number of voters who strictly prefer candidate V to candidate W.
A path from candidate X to candidate Y of strength z is an ordered set of candidates C(1),...,C(n) with the following four properties:
1. C(1) is identical to X.
2. C(n) is identical to Y.
3. For i = 1,...,(n-1): d[C(i),C(i+1)] > d[C(i+1),C(i)].
4. For i = 1,...,(n-1): d[C(i),C(i+1)] hahaha8805; z.
If there is a p such that there is a path from candidate A to candidate B of strength p and no path from candidate B to candidate A of strength p, then candidate A disqualifies candidate B.
Candidate D is a potential winner if and only if there is no candidate E such that candidate E disqualifies candidate D.
Wikipediahahaha174; is a registered trademark of the Wikimedia Foundation, Inc.
Quotes are the worst..
Kid Wave /_\
|