[EM] Rethinking Burial Detection Runoff

[Forest Simmons]

A a couple of clarifications below that time did not allow on the first go
around
 ...

On Fri, Jun 16, 2023, 11:43 AM Forest Simmons <forest.simmons21 at gmail.com>
wrote:

> First a definition:
>
> A candidate X is an enemy of a pair if it beats both of its members.
>
> New Method:
>
> Elect the CW if there is one.
>
> Else elect the sincere winner
>

Sincere winner found by ballots designated "sincere" in the case of voters
that do not need to include a second ranked preference ballot for the
sincere  two candidate runoff.

of the strongest pair that has no enemies, if there is such a pair.
>

In practice such a pair always exists, so the rest of the definition below
is just a tecnicality to cover a statistical impossibility on a par with
winning the lottery jackpot and getting hit by lightening on the same day.

>
> Else elect the sincere winner of the pair whose enemy first place count
>
...
>
[Meaning the total of all the first place counts of all of the enemies of
the pair, if it has any]

is smallest.
>

> fws
>

Note that the sincere runoff is a kind of max potential information runoff,
because the strongest defeat is the last one you would expect to be
reversed under sincere votes.

If it is reversed, you very likely just thwarted a strategic voting
attack.

If not, you just got excellent confirmation that the right candidate was
elected.

In other words, the method, besides being very decisive, is not likely to
reward manipulators ... two features that tend to build much needed voter
confidence in the validity of election results.

fws

>
>>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20230616/6365d518/attachment.htm>