3 ms·
Debian uses the Condorcet method for elections https://en.wikipedia.org/wiki/Condorcet_method https://en.wikipedia.org/wiki/Condorcet_method . Each voter is to
by madars 6y ago
Debian uses the Condorcet method for elections https://en.wikipedia.org/wiki/Condorcet_method https://en.wikipedia.org/wiki/Condorcet_method . Each voter is to rank a subset of all options, and this is the resulting pairwise preference graph.
- nextaccountic 6y agoIf it's the pairwise preference, shouldn't it be a complete graph? (a graph with edges between any two nodes)
- kroeckx 6y agoThe code does not draw lines between the options that didn't pass the quorum or majority test (drawn in pink), because they are dropped before the Schulze method is used. But it then adds the options again, to show all the options. When multiple options are in the Schwartz set, the weakest defeats are removed until only 1 option is left in the Schwartz set. I think it only draws the graph after there is only 1 option left. But that didn't happen in this vote.
- dragonwriter 6y agoI think (I’m not sure) its pairwiss preferences excluding those consistent with transitive preferences. ( so if A > B and B > C, the A to C preference is omitted.)
- arendtio 6y agoThanks, that explains a lot. I was kinda confused by the complexity of the results, but if it is about ranks, it all makes sense now :-)