[EM] MinLengthMaxStrengthCoveringChain

[Forest Simmons]

For our purposes  a chain is a list of alternatives on which every
alternative is defeated by every higher listed alternative.

If every alternative not in the chain is defeated by some member of the
chain, it is said to be a "covering chain".

The length of a chain is the number of alternatives comprising the chain.

The head of the chain is the alternative that defeats all of the other
members of the chain.

The tail of the chain is the alternative defeated by every other chain
member.

Our proposed method is to elect the head of the covering chain of maximum
strength among all those of minimum length.

This method satisfies the ISDA criterion.

In a public political election the MLMSCC chain will almost surely consist
of fewer than three alternatives ... we can safely say never more than
three.

So the winner can be found by comparing the strengths of at most a few
dozen chains.

This would be the case, for example, if the top cycle were to be created by
replacing each member of a rock-paper-scissors cycle with a different clone
cycle of the same kind.

In fact, in that case there would be exactly three dozen covering chains of
length three to check.

To be continued (later today when I get another turn on the cell phone ...)

-fws
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20230424/4f873e7a/attachment.htm>