Commit Graph

2 Commits

Author SHA1 Message Date
Peter J. Holzer 37ed14e1d6 Use all positions to determine order
Since we expect very few votes there is a high probability that several
candidates will be not be ranked first by anybody. Which one is
eliminated is essentially random, so it could happen that a candidate
which is ranked second by everybody (and therefore would probably be the
winner) is eliminated in the first round and never considered again.
To prevent this, we sort by all ranks in order. So among those with the
same number of first ranks the one with the most second ranks wins, if
those are also the same we use the third rank etc. This should ensure
that each round really eliminates the worst candidate (ties are still
possible, but only if the votes at all ranks are the same - in which
case no objective distinction is left and random choice is acceptable).
2022-11-08 23:16:38 +01:00
Peter J. Holzer 049a8d0d70 Test instant runoff algorithm 2022-11-07 21:06:14 +01:00