https://en.wikipedia.org/wiki/Schulze_method https://en.wikipedia.org/wiki/Schulze_method VERY Roughly: Eliminate the weakest candidates until there's a winner

https://en.wikipedia.org/wiki/Schulze_method https://en.wikipedia.org/wiki/Schulze_method VERY Roughly: Eliminate the weakest candidates until there's a winner. Only this method is a formal mathematical twist on that to make it computationally easier for computers to process while yielding the same result. In previous posts I've wanted two additions to this method, but I'm modifying the second after thinking about it. * None of the Above / No Confidence (same, this wins == new vote all old candidates banned) * Allow for a single preference list but don't require all candidates ranked. Confusingly, allowing NotA above other candidates should only yield a warning. It might technically express desired behavior (if my candidates don't win, I have no confidence) while placing it ABOVE some candidates implies that there's not critical confidence in them, a re-run without them would be preferable, BUT that a win with them over another candidate in the race or no-confidence if it isn't stronger than them overall is still preferable.