Hallo,
I rewrote section 5 (Tie-Breaking) of my paper,
so that it is now more in accordance with the
other parts of my paper:
http://m-schulze.webhop.net/schulze1.pdf
Markus Schulze
Election-Methods mailing list - see http://electorama.com/em for list info
Hallo,
in example 3 of my paper, the weakest link of the strongest
path from candidate A to candidate C is the same link as
the weakest link in the strongest path from candidate C
to candidate A:
http://m-schulze.webhop.net/schulze1.pdf
Markus Schulze
Election-Methods mailing list - see
On 2/20/12 1:15 PM, Markus Schulze wrote:
Hallo,
in example 3 of my paper, the weakest link of the strongest
path from candidate A to candidate C is the same link as
the weakest link in the strongest path from candidate C
to candidate A:
http://m-schulze.webhop.net/schulze1.pdf
the thing that
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
traversing
the CD win (which is the weakest link in those paths).
Kevin
De : robert bristow-johnson r...@audioimagination.com
À : election-methods@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
If one removed all pairwise defeats that contradict the Schulze beathpath order
and then constructed a new beatpath order from the reduced set of defeats,
would the new beatpath order always be consistent with (although not
necessarily the same as) the previous beatpath order? Could this
