[EM] Question about Schulze beatpath method

[Kevin Venzke]

Hi Robert,
 
Suppose there are four candidates ABCD. B beats A with strength of 10. C beats D with strength
of 20. With strength of 30, A beats C, B beats C, D beats A, and D beats B. Then every candidate
has a path to every other candidate, and the best path from A to B or from B to A involves traversing 
the C>D win (which is the weakest link in those paths).
 
Kevin
 

De : robert bristow-johnson <rbj at audioimagination.com>
À : election-methods at lists.electorama.com 
Envoyé le : Vendredi 17 février 2012 12h56
Objet : Re: [EM] Question about Schulze beatpath method

On 2/17/12 1:27 PM, Markus Schulze wrote:
> it can happen that the weakest link in the strongest path
> from candidate A to candidate B and the weakest link in the
> strongest path from candidate B to candidate A is the same link,
> say CD.

how can that be?  since a path is a *defeat* path.  you only traverse a beatpath from a candidate who beats the next candidate in the path.

is it that candidates C and D are exactly tied?  other than that, i cannot understand how the weakest link from A to B can be the same as *any* link from B to A.

-- 
r b-j                  rbj at audioimagination.com

"Imagination is more important than knowledge."



----
Election-Methods mailing list - see http://electorama.com/em for list info
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20120217/bde612e9/attachment-0004.htm>