[EM] Poll on voting-systems, to inform voters in upcoming enactment-elections

[Joshua Boehme]

I'm going to try to restate this to see if I follow. Ignore computational complexity for the moment. I'm going to use margins as the basis just to keep it clear.


Take all N! potential orderings, and for each consider the margins for the N(N-1)/2 resulting pairwise comparisons (e.g., A>B>C gives A over B, A over C, and B over C). If you're upholding a pairwise defeat, the margin is positive; if you're reversing a pairwise defeat it's negative; and pairwise ties are always zero. Pick the ordering whose weakest comparison is best. Break ties by looking at the second weakest, then third weakest, etc.

That is, if you sort each ordering's comparison strengths in ascending order, you want the one that is lexicographically best.


Am I right in this?


On 4/9/24 22:58, Forest Simmons wrote:
> I would like to nominate ...
> 
> Max Strength Transitive Beeatpath:
> 
> Elect the head of the strongest transitive  beatpath.
> 
> A transitive beatpath is a list of candidates in which each candidate is
> pairbeaten by every candidate listed ahead of it.
> 
> A transitive beatpath P implies a defeat W>L if W precedes L in the path P.
> 
> The stronger of two different beatpaths is the one that implies the
> strongest defeat that is not implied by the other.
> 
> 
> ----
> Election-Methods mailing list - see https://electorama.com/em for list info