[EM] Favorability Sorted Ranked Pairs

[Forest Simmons]

For each pair P of candidates, let Strength(P)=cov(P)+epsilon*wv(P), where
cov(P)=One If one member of P covers the other one, Else zero EndIf, and
wv(P) is the number of ballots on which the member of P that pairbeats the
other outranks the other.

So the strength of P is primarily determined by whether or not the pairwis
winner covers the loser, and secondarily by the pairwise support of the
winner.

Here's the procedure for constructing the Favorability Rank Pairs Finish
Order FRPFO:

List the candidates in order of favorability. Then ....
While any adjacent pair P is listed with loser(P) ahead of winner(P),
update the list by transposing the strongest such pair. EndWhile.

The final list is the FRPFO.

Suppose the Favorability of a candidate is its max pairwise support. The
corresponding FRPFO order could be called the MaxFRPFO order, and its head
the MaxFRPFO candidate.

Related Burial Resistant Method:

Elect the nemesis of the nemesis of the MaxFRPFO candidate, where the
nemesis of X is the winner of the strongest candidate pair whose loser is X.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20231027/b19f7087/attachment.htm>