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                  r...@audioimagination.com

"Imagination is more important than knowledge."



----
Election-Methods mailing list - see http://electorama.com/em for list info

Reply via email to