[EM] Correction. Big CS fault?

[Elisabeth Varin/Stephane Rouillon]

> 5 ABCD
> 4 BDAC
> 3 CDAB
> 1 DBCA
>
> ...
>
> P.S. The minimum total distance criterion would give the win to A in the
> above example. IRV also picks A. Who would win under the rules of Ranked
> Pairs?
>

Forest --

all preferences are expressed so all criteria give the same result:

A (8) > B (5), A (9) > C (4), D (8) > A(5), B(10) > C (3), B(9) > D (4),
C(8) > D (5).
So B>C locks, then A>C and B>D.
A>B, D>A, C>D cannot all lock.
Only one solution matches 2 out of those 3 locks: A>B>C>D. It should be
locked. A is winner again.
The 5 possibilities:
A>B>C>D checks 2;
A>B>D>C checks 1;
B>D>A>C checks 1;
B>A>D>C checks none;
B>A>C>D checks 1.

Except if anyone knows a better way to resolve ties...
Steph.

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20021227/3280df46/attachment-0003.htm>