<html><head><meta http-equiv="Content-Type" content="text/html charset=windows-1252"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space;">Hi Jenn,<div><span class="Apple-tab-span" style="white-space:pre"> </span>I have responded to your concerns in your email below.</div><div><br><div><div>On Feb 25, 2016, at 8:19 PM, Jennifer Ross <<a href="mailto:2jennross@gmail.com">2jennross@gmail.com</a>> wrote:</div><br class="Apple-interchange-newline"><blockquote type="cite"><div dir="ltr"><div>Hi Paul. I get lost in the math. Are you saying STV except skip the part where we move surplus votes from winning candidates? </div></div></blockquote>Yes and No. Instead of just transferring the surplus votes of a winning candidate, transfer ALL the votes cast for a winning candidate.<br><blockquote type="cite"><div dir="ltr"><div>Because I can get behind that, as long as it works. I shall trust you've done something in the math that makes it work :) </div></div></blockquote>Yes. This process elects precisely the desired number of candidates.<br><blockquote type="cite"><div dir="ltr"><div>Further to that, are you saying the surplus votes that elected a candidate, are therefore exhausted? </div></div></blockquote>No, precisely the opposite. All votes cast for as winning candidate or a rejected candidate remain active at every round until they become exhausted. This version of STV uses as many of the voter’s choices as possible. Some ballots could be used to elect 3 or 4 or more candidates.<br><blockquote type="cite"><div dir="ltr"><div>Because that has always struck me as fair, although I understood that it leaves remaining and still eligible candidates with too few votes to reach the threshold. And that doesn't strike me as fair so I was willing to go with the percentage of surplus transfer kind of thing. I definitely think it is unfair to count the last ballots (after threshold has been reached) for the next choice on it, because that strikes me as getting two votes.<br></div></div></blockquote>This version of STV deals with ballots cast for winning candidates in the same way that it deals with ballots for rejected candidates. This is the main idea behind this version of STV.</div><div><br></div><div>THE BIG QUESTIONS:</div><div>Is this version of STV a proportional electoral system?</div><div>If so, to what is it proportional? (So many of the voters’ choices are being exercised, it may not be possible to answer this question.)<br><blockquote type="cite"><div dir="ltr"><div><br></div><div>But I very much like STV.<br></div><div><br></div>Jenn<br></div><div class="gmail_extra"><br><div class="gmail_quote">On Thu, Feb 25, 2016 at 5:32 PM, Paul Schellenberg <span dir="ltr"><<a href="mailto:pjschell@sympatico.ca" target="_blank">pjschell@sympatico.ca</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">Hello Everyone,<br>
I oppose STV because of the role of surplus votes. Though there are different ways to deal the surplus votes, all of them appear to be flawed, as far as I can see.<br>
<br>
Here is a way to implement STV that eliminates surplus votes.<br>
<br>
A Variation on STV<br>
===============<br>
<br>
C - the number of candidates to be elected in the riding<br>
B - total number of valid ballots<br>
election threshold - B/(C+1) + 1<br>
<br>
INITIAL ITERATION:<br>
Use voters' first choices to determine the candidates who meet the “election threshold” and are elected.<br>
If C candidates are elected, the election is complete.<br>
If no candidate has been elected, the candidate with the smallest number of votes is rejected. (This step is essential.)<br>
<br>
GENERAL ITERATION:<br>
Definition: We say a ballot is EXHAUSTED if every ranked candidate on the ballot has been rejected or has been elected.<br>
Let B* = B - (the number of exhausted ballots)<br>
Let C* = C - (the number of elected candidates)<br>
The new election threshold is B*/(C*+1) + 1<br>
Definition: A candidate is said to be ELIGIBLE if he or she has not yet been elected or rejected.<br>
EVERY non-exhausted ballot is assigned to the eligible candidate having the highest ranking.<br>
Count the ballots for each eligible candidate.<br>
Any candidate who meets the new election threshold B*/(C*+1) + 1 is declared elected.<br>
If C candidates are elected, the election is complete.<br>
If no candidate is elected in this iteration, the candidate with the smallest number of votes is rejected. (This step is essential.)<br>
Iterate.<br>
<br>
(Note that, in each iteration, every ballot that is not exhausted is counted.)<br>
<span class="HOEnZb"><font color="#888888"><br>
Paul Schellenberg<br>
</font></span><span class="im HOEnZb"><br>
On Feb 24, 2016, at 5:57 PM, Bob Jonkman <<a href="mailto:bjonkman@sobac.com">bjonkman@sobac.com</a>> wrote:<br>
<br>
> -----BEGIN PGP SIGNED MESSAGE-----<br>
> Hash: SHA1<br>
><br>
> Hi Donald: Yes, please bring your sample ballots.<br>
><br>
> I've put the ballots from our mock election last Discussion Night at<br>
> <a href="http://www.fairvotewrc.ca/resources/election-simulation/" rel="noreferrer" target="_blank">http://www.fairvotewrc.ca/resources/election-simulation/</a> I can add<br>
> your sample ballots if you send me the files.<br>
><br>
> I didn't do a good job of counting the STV ballots from our mock<br>
> election last time, so I want to count them again, this time following<br>
> a recipe, or several different recipes, and seeing the difference.<br>
> <a href="https://en.wikipedia.org/wiki/Counting_single_transferable_votes" rel="noreferrer" target="_blank">https://en.wikipedia.org/wiki/Counting_single_transferable_votes</a><br>
><br>
> For those people not interested in the mechanics of counting ballots<br>
> there's lots of other stuff to discuss, such as the apparent support<br>
> for anything-but-FPTP from our Minister of Democratic Institutions:<br>
><br>
> <a href="http://www.cbc.ca/news/politics/monsef-electoral-reform-changes-referendum-1.3428593" rel="noreferrer" target="_blank">http://www.cbc.ca/news/politics/monsef-electoral-reform-changes-referendum-1.3428593</a><br>
><br>
> Or the renewed enthusiasm for electoral reform in Prince Edward Island:<br>
><br>
> <a href="http://www.cbc.ca/news/canada/prince-edward-island/voting-reform-elections-meetings-1.3455222" rel="noreferrer" target="_blank">http://www.cbc.ca/news/canada/prince-edward-island/voting-reform-elections-meetings-1.3455222</a><br>
><br>
> See you all next Monday!<br>
><br>
> - --Bob.<br>
<br>
<br>
</span><div class="HOEnZb"><div class="h5">_______________________________________________<br>
This is the fvc-wat-disc mailing list<br>
Post a message: <a href="mailto:fvc-wat-disc@listserv.thinkers.org">fvc-wat-disc@listserv.thinkers.org</a><br>
Unsubscribe: <a href="http://listserv.thinkers.org/mailman/listinfo/fvc-wat-disc_listserv.thinkers.org" rel="noreferrer" target="_blank">http://listserv.thinkers.org/mailman/listinfo/fvc-wat-disc_listserv.thinkers.org</a><br>
<br>
</div></div></blockquote></div><br><br clear="all"><br>-- <br><div class="gmail_signature"><div dir="ltr"><div><div dir="ltr"><div><div dir="ltr"><div style="font-size: 10px; background-color: transparent; font-style: normal;"><span><font color="#888888"><font size="1"><span style="font-family:tahoma,new york,times,serif"><span style="line-height:10.909090995788574px">No other Western democratic country concentrates as much political power </span></span></font><font size="1"><span style="font-family:tahoma,new york,times,serif"><span style="line-height:10.909090995788574px">in the hands of one person as Canada does with her Prime Minister. </span></span></font></font></span></div></div></div></div></div></div></div>
</div>
_______________________________________________<br>This is the fvc-wat-disc mailing list<br>Post a message: <a href="mailto:fvc-wat-disc@listserv.thinkers.org">fvc-wat-disc@listserv.thinkers.org</a><br>Unsubscribe: <a href="http://listserv.thinkers.org/mailman/listinfo/fvc-wat-disc_listserv.thinkers.org">http://listserv.thinkers.org/mailman/listinfo/fvc-wat-disc_listserv.thinkers.org</a><br></blockquote></div><br></div></body></html>