<html><body><div style="color:#000; background-color:#fff; font-family:times new roman, new york, times, serif;font-size:12pt"><div style="RIGHT: auto"><SPAN style="RIGHT: auto">Hi Robert,</SPAN></div>
<div style="RIGHT: auto"><SPAN style="RIGHT: auto"><VAR id=yui-ie-cursor></VAR></SPAN> </div>
<div style="RIGHT: auto"><SPAN style="RIGHT: auto">Suppose there are four candidates ABCD. B beats A with strength of 10. C beats D with strength</SPAN></div>
<div style="RIGHT: auto"><SPAN style="RIGHT: auto">of 20. With strength of 30, A beats C, B beats C, D beats A, and D beats B. Then every candidate</SPAN></div>
<div style="RIGHT: auto"><SPAN style="RIGHT: auto">has a path </SPAN><SPAN style="RIGHT: auto">to every other candidate, and the best path from A to B or from B to A involves traversing </SPAN></div>
<div style="RIGHT: auto"><SPAN style="RIGHT: auto">the </SPAN><SPAN style="RIGHT: auto">C>D win (which is the weakest link in those paths).</SPAN></div>
<div style="RIGHT: auto"><SPAN style="RIGHT: auto"></SPAN> </div>
<div style="RIGHT: auto"><SPAN style="RIGHT: auto">Kevin</SPAN></div>
<div style="RIGHT: auto"><SPAN style="RIGHT: auto"></SPAN> </div>
<div><BR></div>
<DIV style="FONT-SIZE: 12pt; FONT-FAMILY: times new roman, new york, times, serif">
<DIV style="FONT-SIZE: 12pt; FONT-FAMILY: times new roman, new york, times, serif">
<DIV dir=ltr><FONT face=Arial size=2>
<DIV class=hr style="BORDER-RIGHT: #ccc 1px solid; PADDING-RIGHT: 0px; BORDER-TOP: #ccc 1px solid; PADDING-LEFT: 0px; FONT-SIZE: 0px; PADDING-BOTTOM: 0px; MARGIN: 5px 0px; BORDER-LEFT: #ccc 1px solid; LINE-HEIGHT: 0; PADDING-TOP: 0px; BORDER-BOTTOM: #ccc 1px solid; HEIGHT: 0px" readonly="true" contenteditable="false"></DIV><B><SPAN style="FONT-WEIGHT: bold">De :</SPAN></B> robert bristow-johnson <rbj@audioimagination.com><BR><B><SPAN style="FONT-WEIGHT: bold">À :</SPAN></B> election-methods@lists.electorama.com <BR><B><SPAN style="FONT-WEIGHT: bold">Envoyé le :</SPAN></B> Vendredi 17 février 2012 12h56<BR><B><SPAN style="FONT-WEIGHT: bold">Objet :</SPAN></B> Re: [EM] Question about Schulze beatpath method<BR></FONT></DIV><BR>On 2/17/12 1:27 PM, Markus Schulze wrote:<BR>> it can happen that the weakest link in the strongest path<BR>> from candidate A to candidate B and the weakest link in the<BR>> strongest path from
candidate B to candidate A is the same link,<BR>> say CD.<BR><BR>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.<BR><BR>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.<BR><BR>-- <BR>r b-j <A href="mailto:rbj@audioimagination.com" ymailto="mailto:rbj@audioimagination.com">rbj@audioimagination.com</A><BR><BR>"Imagination is more important than knowledge."<BR><BR><BR><BR>----<BR>Election-Methods mailing list - see <A href="http://electorama.com/em" target=_blank>http://electorama.com/em</A> for list info<BR><BR><BR></DIV></DIV></div></body></html>