tag:blogger.com,1999:blog-8217294657304563413.post2485553461163966226..comments2020-09-09T13:05:21.380-07:00Comments on OpaVote Blog: Guest Post: Rethinking STV FundamentalsJeffhttp://www.blogger.com/profile/11828614939910702199noreply@blogger.comBlogger38125tag:blogger.com,1999:blog-8217294657304563413.post-79382327122346806632019-11-14T12:13:09.576-08:002019-11-14T12:13:09.576-08:00Actually, looking closely at those links you provi...Actually, looking closely at those links you provided, it looks like after a candidate is elected, surplus votes are not proportionally transferred to their next choice. So the "sequential IRV" algorithm is less fair than what I show in column L.happyjack27https://www.blogger.com/profile/06322415607461417789noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-34412444593894505622019-11-14T12:04:55.546-08:002019-11-14T12:04:55.546-08:00Before I wrote the article, I wrote a program to t...Before I wrote the article, I wrote a program to test a few combinations of rules, and foudn 42 different test cases to run it on, and compiled the results into a spreadsheet:<br /><br />https://docs.google.com/spreadsheets/d/18AN5xli49l39Fh5bRQerLPF0iT5AJpEjY6dvUzk-TUI/edit?usp=sharing<br /><br />Column M is traditional STV<br />Column N is "sequential IRV"<br />Column F is "Baas results"<br />Column E (a late addition to the spreadsheet) is a modification of "Baas results" that is a lot faster (polynomial time), so is practical for elections with very may candidates. <br /><br />happyjack27https://www.blogger.com/profile/06322415607461417789noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-54153902631595295362019-11-14T09:24:55.778-08:002019-11-14T09:24:55.778-08:00In Nov 2019, the Utah county cities of Payson and ...In Nov 2019, the Utah county cities of Payson and Vineyard did multi-winner city council elections using Sequential IRV tallies.<br /><br />It occured to me that the issue of re-introducing eliminated candidates is handled by doing these subsequent IRV tallies.<br />By doing a single winner IRV, they are using 50%+1 Droop quota each time with that quota being re-calculated based upon the "continuing" ballots.<br /><br />Would be cool to see sequential IRV results plotted alongside traditional STV and Baas results.<br /><br />http://utahcounty.gov/Dept/ClerkAud/Elections/ResultsTracking.html<br />https://rcvis.com/visualize=payson-seat-1-2019-11-12_13-46-26_summary_1json<br />https://rcvis.com/visualize=payson-seat-2-2019-11-12_13-46-26_summary_2json<br />https://rcvis.com/visualize=payson-seat-3-2019-11-12_13-46-26_summary_3json<br />https://rcvis.com/visualize=vineyard-seat-1-2019-11-12_13-49-22_summary_1json<br />https://rcvis.com/visualize=vineyard-seat-2-2019-11-12_13-49-22_summary_2json<br />CJMDriverhttps://www.blogger.com/profile/15490603723527490710noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-5954145570331009852019-09-17T15:04:13.971-07:002019-09-17T15:04:13.971-07:00Ah, thank you. Ah, thank you. saideshttps://www.blogger.com/profile/05177019537536865744noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-686763101492210002019-09-17T14:01:42.407-07:002019-09-17T14:01:42.407-07:00by "adjusting the max borda value" i mea...by "adjusting the max borda value" i mean that after you drop or elect a candidate, you recompute the borda counts from scratch, since now you have a different number of candidates and/or a different number of ballots.happyjack27https://www.blogger.com/profile/06322415607461417789noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-17426644872772929652019-09-17T12:06:36.599-07:002019-09-17T12:06:36.599-07:00When you say, adjusting the max borda value, I tak...When you say, adjusting the max borda value, I take it this method depends on conventional borda count rules? That is, NOT a system like Dowdall/Nauru, which would not give the same results? (the wikipedia article on Borda claims that 30% of Nauru elections would have a different winner using more conventional borda rules; also claims that the Nauru system favors higher-ranked candidates more than conventional borda, which seems reasonable to my own untrained eye--that is, likely to be true, and also possibly a good idea. I also like Nauru because I feel like it would be simpler to describe)saideshttps://www.blogger.com/profile/05177019537536865744noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-13370155437323486992019-08-23T14:07:31.551-07:002019-08-23T14:07:31.551-07:00Eureka!
So I decided to try the traditional elimi...Eureka!<br /><br />So I decided to try the traditional elimination algorithm, but instead of elimination the fewest first choices each round, eliminating the candidate with the lowest Borda Count (adjusting the max borda value for elected and dropped candidates, and using the re-weighted ballots). I've added the results to my spreadsheet, column E. ( https://docs.google.com/spreadsheets/d/18AN5xli49l39Fh5bRQerLPF0iT5AJpEjY6dvUzk-TUI/edit?usp=sharing ) It is very close to FEO, and completes in polynominal time (something like O(N^2), I think.)!<br /><br />So there's the solution to the issue of computing time when there are a lot of candidates.happyjack27https://www.blogger.com/profile/06322415607461417789noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-51644300284753036562019-08-23T12:18:53.633-07:002019-08-23T12:18:53.633-07:00Here's an idea:
1) for each candidate, find o...Here's an idea: <br />1) for each candidate, find out what other candidates would have to be eliminated for that candidate to make quota, with the fewest overall rank demotions. this could be about O(N^2) per candidate, so O(N^3) total for this step.<br />2) find the candidate(s) with the lowest number of such rank demotions to make quota. O(N)<br />3) if there is only one such candidate, that's the winner. if there is a tie, take the one with the most votes in their respective scenarios.<br /><br />If I'm thinkiing that through right it would be O(N^3) time, which is much better than O(N!), and would have similiar results to FEO. Someone would have to code it and test on the 43 scenarios i collected.happyjack27https://www.blogger.com/profile/06322415607461417789noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-11078854018001561262019-08-23T06:23:07.447-07:002019-08-23T06:23:07.447-07:00I'm curious what you mean by "my local co...I'm curious what you mean by "my local community". Elections for a municipality? The ballots can be entered into a computer by hand and then computer tallied. This would be more accurate and reliable than a hand tally. If people are concerned about transparency, one could provide the source code and the data (anonymized, of course), so that any one can reproduce the tally. I'm sure there are ways to have a faster elimination ordering that comes close to the accuracy of the FEO. I'm not sure your suggestion is the best approach, though. I'll have to give it some thought.<br /><br />One could use the traditional STV elimination (eliminate lowest total until someone meets quota), and then look at each dropped candidate and see if they would have won if they weren't dropped but all the others that were dropped were still dropped. e.g. if lowercase means dropped, when someone meets quota at A B C d e f, try A B C D e f, A B C d E f, and A B C d e F. then if D, E, or F win, that's the real winner. So it's basic STV elimination, with an added rollback test on each dropped candidate.happyjack27https://www.blogger.com/profile/06322415607461417789noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-86870595712156454612019-08-22T12:39:24.076-07:002019-08-22T12:39:24.076-07:00Mr. Baas, I've been very impressed with this r...Mr. Baas, I've been very impressed with this revision of the STV counting process and I'm hoping to get the shortcut version known and implemented in my local community. I don't see the full elimination ordering being sufficiently practical, unfortunately, especially if ballots are counted by hand. But I wonder if one could get any closer to the FEO result by eliminating the candidate who appears, at all rankings, on the fewest ballots, instead of the one with the fewest votes. saideshttps://www.blogger.com/profile/05177019537536865744noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-29412705758702052522019-07-21T06:23:53.902-07:002019-07-21T06:23:53.902-07:00In the system I invented, which uses four averages...In the system I invented, which uses four averages or representative counts, the first average is of the Hare quota and the Droop quota, which I worked-out to be a Harmonic Mean quota (because these quotas are harmonic series): HMQ = votes/(seats + 1/2). <br />The FAB STV system does not eliminate candidates, permanently or temporarily, before the full schedule of the count is complete.<br />FAB STV extends the Meek STV use of keep values. But discards its quota reduction (also employed here). The FAB STV way is that all preferences are counted (maximum use of preference information) including abstentions, which makes quota reduction irrelevant. DemocracySciencehttps://www.blogger.com/profile/07658657506368612732noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-67474374846691244852018-12-19T13:07:43.337-08:002018-12-19T13:07:43.337-08:00The "full elimination ordering" has some...The "full elimination ordering" has something like 5 levels of tie-breaking. I ran a bunch of simulations to optimize the tie-breaking order. (Though really the first tie-breaking criteria is exponentially more important than the others.) The best first criteria I found was "fewest rank demotions". But yeah, failing an efficient way to do that, or some other deterministic criteria, random tie breaking would be the next best. Random tie breaking can be implemented without adding a checkbox, simply by randomly sorting the candidates _before_ tallying and determining winners. i.e. randomly assigning each candidate to "A,B,C,...", instead of a deterministic method such as alphabetical.happyjack27https://www.blogger.com/profile/06322415607461417789noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-16752696251858639212018-12-18T20:03:25.470-08:002018-12-18T20:03:25.470-08:00Speaking of ties, I tried a sample election and no...Speaking of ties, I tried a sample election and noticed that your algorithm eliminates tied candidates in the order they are listed, leaving the last of the tied candidates to be winners. I suppose that there is not much that can be done with ties, but it would seem that it would be better to eliminate randomly than to eliminate in ballot order (although your method does provide better information as to what is happening). Maybe a checkbox that says "eliminate ties randomly" would be helpful. Anonymoushttps://www.blogger.com/profile/08560473952197625800noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-52438192711469452362018-12-18T11:20:43.027-08:002018-12-18T11:20:43.027-08:00This comment has been removed by the author.Anonymoushttps://www.blogger.com/profile/08560473952197625800noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-65691700814836549282018-12-14T13:23:29.998-08:002018-12-14T13:23:29.998-08:00No. The +1 is unimportant. All it means is that ...No. The +1 is unimportant. All it means is that ties don't result in two winners, but must be broken somehow. It's the same as how in majority systems you need 50% plus one vote. So for instance if in the U.S. Senate, a vote is split exactly 50-50, the bill doesn't pass. But since the Hare quota uses up every vote exactly, you can't apply a [quota]+1 rule, since for the last seat you will have exactly [quota] ballots left. TLDR; the extra +1 on the quota really doesn't matter. We're talking on the order of 100,000 votes vs. 100,001 votes.happyjack27https://www.blogger.com/profile/06322415607461417789noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-60314708621345183442018-12-14T12:49:55.680-08:002018-12-14T12:49:55.680-08:00Rereading parts of your post, I noticed that you u...Rereading parts of your post, I noticed that you used votes/(seats+1) for the Droop quota. I thought that (votes/(seats+1))+1 was generally used for Droop. Does that reduce the Droop problems that you describe?Anonymoushttps://www.blogger.com/profile/08560473952197625800noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-58746306342603686392018-12-05T10:06:03.803-08:002018-12-05T10:06:03.803-08:00I thought so, but just wanted to make sure. Many t...I thought so, but just wanted to make sure. Many thanks!Anonymoushttps://www.blogger.com/profile/08560473952197625800noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-27844579179997718932018-12-04T13:16:06.330-08:002018-12-04T13:16:06.330-08:00Yes, it "eliminate[s] this problem by adding ...Yes, it "eliminate[s] this problem by adding back eliminated candidates each round". This is true for the "shortcut" (not full elimination ordering) version, too. The drawback of the "shortcut" version is that in some situations (like what you show above), it doesn't pick the number one best choice. The full elimination ordering does a comprehensive search, the shortcut version does not - which is precisely why it's so much faster. But yeah, in either case, temporarily dropped candidates are re-introduced each round. That's the big flaw in other STV systems that I realized needed fixing. The other changes were just icing on the cake.happyjack27https://www.blogger.com/profile/06322415607461417789noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-29289109397277970902018-12-04T10:10:51.742-08:002018-12-04T10:10:51.742-08:00To Kevin:
Thanks again.
I have another question. W...To Kevin:<br />Thanks again.<br />I have another question. With other STV systems, there is a potential problem if there are too many candidates and not enough voters. A person who many would like second best might be eliminated (this is described elsewhere on this website). Does your Baas system, especially the shortcut version you created, reduce or eliminate this problem by adding back eliminated candidates each round?Anonymoushttps://www.blogger.com/profile/08560473952197625800noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-65343890423145149482018-11-03T13:54:32.642-07:002018-11-03T13:54:32.642-07:00I did check your new algorithm and it did compute ...I did check your new algorithm and it did compute way faster. So, thanks for doing that. You have provided a good start; I hope someone can finish it!<br /><br />Below is one example which shows that using the Hare quota can matter. With it, there is no change in result from a tactical change by one voter. Without it, the voter needs to be aware that voting her preference might lead to her least favorite candidate winning (under a full elimination system). <br /><br />one seat; 21 voters<br />10 orderings are A,B,C<br />2 orderings are B,C,A<br />3 orderings are B,A,C<br />6 orderings are C,B,A<br />hare quota, not full elimination=A<br />not hare quota, not full elimination=A<br />hare quota, full elimination=B<br />not hare quota, full elimination=A<br /><br />change one ordering from CBA to BCA<br />hare quota, not full elimination=A<br />not hare quota, not full elimination=A<br />hare quota, full elimination=B<br />not hare quota, full elimination=B<br />Anonymoushttps://www.blogger.com/profile/08560473952197625800noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-89149447339529519562018-11-02T23:42:39.794-07:002018-11-02T23:42:39.794-07:00You're welcome. To be clear I'm pretty su...You're welcome. To be clear I'm pretty sure you have to do the "full elimination ordering" to completely prevent the issue that you described: voting a candidate higher can result in them not getting elected. The chance is reduced by adding dropped candidates back in, but it is not zero.<br /><br />IMO the greatest issue with my proposed method is that the time to compute winners is O(N!), but I think that<br />* even if you don't use full elimination ordering, the result is still better. Using only the other two changes still is an objectively better process than using none of the changes.<br />* using lemmas such as I described, it's possible to construct an algorithm that has all three rules, while still being computationally practical, even for elections with 50+ candidates.<br />It remains for that algorithm to be written. But I feel I've provided a good start.happyjack27https://www.blogger.com/profile/06322415607461417789noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-37874625807844304152018-11-02T16:54:53.532-07:002018-11-02T16:54:53.532-07:00Thanks! When I have a minute I'll check it out...Thanks! When I have a minute I'll check it out. In my case, 4 seats should be enough (although maybe we will have 50 candidates at some point). Thanks again!Anonymoushttps://www.blogger.com/profile/08560473952197625800noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-12640365740671834042018-11-02T15:43:37.620-07:002018-11-02T15:43:37.620-07:00These are my notes from a few years ago on lemmas ...These are my notes from a few years ago on lemmas you could use to compute tge order of dropping candidates "as needed":<br /><br />where a,b represents total rank demotions caused by dropping candidates a and b<br /><br />(a,b) >= (a)<br />(a)+(b) >= (a,b)<br />3*({a}+{b}+{c}) >= {a,b,c} >= 1/3*({a}+{b}+{c})<br /><br />Also it has recently occurred to me that if one can prove that the candidate who would win a borda count is always a winner, no matter how many seats are chosen, then there exists an algorithm that finds all winners in o(n) time. (where n is number of candidates) but is suspect one can't prove that.<br />happyjack27https://www.blogger.com/profile/06322415607461417789noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-21784276436577504422018-11-02T14:33:08.569-07:002018-11-02T14:33:08.569-07:00I've update the counter at http://autoredistri...I've update the counter at http://autoredistrict.org/ranked_choice_counter.zip <br />* I added a "find winners" button. It won't calculate until you press that. So now you can enter all the orderings without having to have it recalculate all the time.<br />* When you uncheck "full elinination ordering", it won't pre-compute all possible orderings.<br /><br />40 should now be manageable, if you first un-check "full elimination ordering".<br /><br />You can see the drawback of that by comparing column "I" on the spreadsheet with column "E". ( https://docs.google.com/spreadsheets/d/18AN5xli49l39Fh5bRQerLPF0iT5AJpEjY6dvUzk-TUI/edit#gid=0 )<br />And you can see the remaining advantages over standard STV by comparing "I" with "L".<br />* It still produces a more proportional result than standard STV.<br />* And protects against tactical voting better than standard STV.<br /><br />But yeah, having to pre-compute 40! orderings... that's a no-go. To make 40 practical, using full ordering, I'd have to change it so the orderings are computed as-needed. This would be much closer to 40 operations than 40! operations.happyjack27https://www.blogger.com/profile/06322415607461417789noreply@blogger.comtag:blogger.com,1999:blog-8217294657304563413.post-22590483340921326752018-11-02T13:43:44.072-07:002018-11-02T13:43:44.072-07:00Well this motivates me to update it to handle big ...Well this motivates me to update it to handle big elections better. I'll shoot for 40 in an hour on a typical desktop. I think i can benefit from there being much fewer seats than candidates. how many seats?happyjack27https://www.blogger.com/profile/06322415607461417789noreply@blogger.com