Talk:Schulze method: Difference between revisions
→Clearer Path Heuristic Procedure Section: new section
No edit summary |
Epsilon Rose (talk | contribs) (→Clearer Path Heuristic Procedure Section: new section) |
||
Line 26:
: Schulze doesn't drop candidates, just defeats. E.g. suppose the initial Schwartz set is {ABCD}. Then that means there must be a cycle among these candidates. Schulze drops the weakest defeat involving these four candidates. This resolves a part of the cycle (e.g. suppose the four-cycle has an embedded ABCA cycle, and it breaks C>A; then A>B and B>C is transitive). As a consequence, someone gets booted out of the Schwartz set (e.g. if there's an ABCA cycle and D beats C as well, then C gets booted out of the Schwartz set since no undropped defeat has C beating someone else). Rinse and repeat until everybody but one candidate is booted out, or the candidates remaining all tie each other. If it's the latter, then you have a tie for victory, otherwise the remaining candidate wins. [[User:Kristomun|Kristomun]] ([[User talk:Kristomun|talk]]) 21:56, 25 February 2020 (UTC)
== Clearer Path Heuristic Procedure Section ==
I think the Path Heuristic Procedure section could be a lot clearer if it was written in plain English, rather than math/logic notation. Unless I'm misunderstanding something, I think the following should have an equivalent effect:
You can find the strength of a path from candidate X to candidate Y by creating a sequence of candidates with the following 4 properties:
# The sequence starts with candidate X.
# The sequence ends with candidate Y.
# Each candidate in the sequence is preferred by more voters than the next candidate.
# There are no repeated candidates.
The strength of any given path is equivalent to the smallest margin of victory between two sequential candidates on that path, unless no valid sequence can be constructed, in which case the path from candidate X to candidate Y is said to have a strength of 0.
Candidate X is only better than candidate Y if the strongest path from X to Y is greater than the strongest path from Y to X.
Candidate X can only be a potential winner if their strongest path to every other candidate is at least as strong as that candidate's path to them.
--[[User:Epsilon Rose|Epsilon Rose]] ([[User talk:Epsilon Rose|talk]]) 20:30, 26 March 2021 (UTC)
| |||