<html><body><div style="color:#000; background-color:#fff; font-family:HelveticaNeue, Helvetica Neue, Helvetica, Arial, Lucida Grande, sans-serif;font-size:12px"><div id="yui_3_16_0_1_1428973357464_2598" dir="ltr"><span>Hi Robert,</span></div><div id="yui_3_16_0_1_1428973357464_2598" dir="ltr"><span><br></span></div><div id="yui_3_16_0_1_1428973357464_2598" dir="ltr"><span id="yui_3_16_0_1_1428973357464_3027">Yes. Only one of B>D or C>D (you don't mention whether perhaps A>D is also the case) can be locked against D. </span>If B>D is stronger than C>D, then when we encounter C>D, we'll throw it out, even if it wouldn't cause a cycle. (D has already lost the election.)</div><div id="yui_3_16_0_1_1428973357464_2598" dir="ltr"><br></div><div id="yui_3_16_0_1_1428973357464_2598" dir="ltr">Kevin</div><br> <div style="font-family: HelveticaNeue, Helvetica Neue, Helvetica, Arial, Lucida Grande, sans-serif; font-size: 12px;" id="yui_3_16_0_1_1428973357464_2769"> <div style="font-family: HelveticaNeue, Helvetica Neue, Helvetica, Arial, Lucida Grande, sans-serif; font-size: 16px;" id="yui_3_16_0_1_1428973357464_2768"> <div dir="ltr" id="yui_3_16_0_1_1428973357464_2767"> <hr size="1" id="yui_3_16_0_1_1428973357464_2812"> <font size="2" face="Arial"> <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> Lundi 13 avril 2015 18h49<br> <b><span style="font-weight: bold;">Objet :</span></b> Re: [EM] "non-cyclic" pairwise loss?<br> </font> </div> <div class="y_msg_container" id="yui_3_16_0_1_1428973357464_2813"><br>On 4/13/15 6:56 PM, Kevin Venzke wrote:<div class="qtdSeparateBR"><br><br></div><div class="yqt8660219079" id="yqtfd67512"><br clear="none">><br clear="none">> "Non-cyclic pairwise loss" just means a loss that wouldn't create a <br clear="none">> cycle of locked wins (at the time in the process that you consider the <br clear="none">> loss). RP has this concept just like River does. What makes River seem <br clear="none">> similar to a Minmax method is that only one loss (the strongest <br clear="none">> non-cyclic one) will get counted for any particular candidate. Once <br clear="none">> you lock a win against somebody, you won't lock any more against them.</div><br clear="none">><br clear="none"><br clear="none">quick question: if A beats B and A beats C and both B and C beat D, does <br clear="none">River open that loop? it ain't a cycle. A has two beat-paths against <br clear="none">D. does River prevent one of them?<br clear="none"><br clear="none">just trying to grok the basic.<br clear="none"><br clear="none">-- <br clear="none"><br clear="none">r b-j <a shape="rect" ymailto="mailto:rbj@audioimagination.com" href="mailto:rbj@audioimagination.com" id="yui_3_16_0_1_1428973357464_3054">rbj@audioimagination.com</a><br clear="none"><br clear="none">"Imagination is more important than knowledge."<br clear="none"><br clear="none"><br clear="none"><br clear="none">----<br clear="none">Election-Methods mailing list - see <a shape="rect" href="http://electorama.com/em" target="_blank">http://electorama.com/em </a>for list info<div class="yqt8660219079" id="yqtfd08826"><br clear="none"></div><br><br></div> </div> </div> </div></body></html>