<div dir="ltr">



















<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New"">If,
using voted rankings, Sequential-Pairwise’s comparison-order is determined by
giving, to the candidates with higher top-count score, a later position in the
comparison-order, so that voters don’t know what the comparison-order will be…<span></span></span></p>

<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New"">…<span></span></span></p>

<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New"">…&
if voters’ knowledge of eachother’s preferences is no better than it is now in
political-elections…<span></span></span></p>

<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New"">…<span></span></span></p>

<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New"">…Does
that Sequential-Pairwise election have an offensive strategy with
gain-expectation comparable to what it would have in MinMax, RP & CSSD?<span></span></span></p>

<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New""><span> </span></span></p>

<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New"">…And,
if so, is there a defensive strategy to thwart or deter that offensive
strategy?<span></span></span></p>

<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New""><span> </span></span></p>

<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New"">…That
seems of interest because Sequential-Pairwise is so much less
computationally-demanding than the other pairwise-count methods.<span></span></span></p>

























<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New"">If,
using voted rankings, Sequential-Pairwise’s comparison-order is determined by
giving, to the candidates with higher top-count score, a later position in the
comparison-order, so that voters don’t know what the comparison-order will be…<span></span></span></p>

<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New"">…<span></span></span></p>

<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New"">…&
if voters’ knowledge of eachother’s preferences is no better than it is now in
political-elections…<span></span></span></p>

<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New"">…<span></span></span></p>

<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New"">…Does
that Sequential-Pairwise election have an offensive strategy with
gain-expectation comparable to what it would have in MinMax, RP & CSSD?<span></span></span></p>

<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New""><span> </span></span></p>

<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New"">…And,
if so, is there a defensive strategy to thwart or deter that offensive
strategy?<span></span></span></p>

<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New""><span> </span></span></p>

<p class="MsoNormal" style="margin:0in 0in 0.0001pt;line-height:normal;font-size:11pt;font-family:"Calibri","sans-serif""><span style="font-size:10pt;font-family:"Courier New"">…That
seems of interest because Sequential-Pairwise is so much less
computationally-demanding than the other pairwise-count methods.<span></span></span></p>





</div>