[EM] Score Cover Sort

[Forest Simmons]

Remember that candidate X "defeats" candidate Y iff X is ranked or rated
ahead of Y on more ballots than Y is ranked or rated ahead of X.

Additionally candidate X "covers" candidate Y iff candidate X not only
defeats Y, but also any candidate that does defeat X also defeats Y.

For each candidate, make a 3"×5" card with its name, score, list of
candidates it covers, and a list of any other candidates defeated by it.

First sort the cards by score.

Then while any candidate X covers some candidate Y above it (in the card
deck) reinsert the highest such X card immediately above the highest
candidate Y that it covers.

Elect the candidate that finishes at the top of the deck.

This is the simplest monotone, clone free finish order that I know of that
always elects an uncovered candidate.

Since it respects the score as far as possible while monotonically electing
an uncovered candidate, it is probably the highest Voter Satisfaction
Efficiency, monotone method that always elects an uncovered candidate.

And think of the dissatisfaction that inevitably results when a method can
elect a covered candidate!

-Forest
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20220717/d7a3b00e/attachment.htm>