[EM] Easy fix to Alaska's ranked-choice voting

[Forest Simmons]

Evidently the IRV proposers hacve had to settle for ránking only there or
tour candidateson each ballot ... better than nothing.

One pass through the ballots to get the pairwise information and the number
of truncations for each candidate ... the exact same work as the SPE method
you propose ... but an agenda of first place votes breeds lots of vote
splitting unless you expect the voters to have lots of equal first rankings
... not a good idea.

Electing the uncovered candidate unranked on the fewest ballots is a
simpler Condorcet method than SPE ... and it is guaranteed to elect an
uncovered member of the Smith Set.

But SPE is also good ... if the agenda is clone independent, like implicit
approval.

-Forest


On Fri, Nov 11, 2022, 5:26 PM Colin Champion <colin.champion at routemaster.app>
wrote:

> On 11/11/2022 20:49, Forest Simmons wrote:
> >
> > Since almost all RCV implementations limit the number of candidates
> > that can be ranked on a ballot, the simplest decent  RCV method is ...
> > Elect the uncovered candidate that is unranked on the fewest ballot
> >
> Does anyone know why this truncation is imposed? If it’s to limit the
> amount of work needed to count the ballots, wouldn’t it make sense for
> Condorcet supporters to advocate a method which was countable in linear
> time? In practice this would presumably be Sequential Pairwise
> Elimination with an FPTP pre-ranking. If you insist on a quadratic time
> method and accept the corollary of ballot truncation, I don’t imagine it
> will work very well. Or am I missing something?
>
> CJC
> ----
> Election-Methods mailing list - see https://electorama.com/em for list
> info
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20221112/6b9490dc/attachment.htm>