Majority Acceptable Score voting: Difference between revisions

2/3 rule
imported>Homunq
No edit summary
imported>Homunq
(2/3 rule)
Line 1:
Majority Acceptable Score voting works as described below. Technically speaking, it's the [[graded Bucklin]] method which uses [[3 grade levels]] and breaks median ties using [[Score voting]].
 
# Voters can givesupport, accept, or reject each candidate. 0,Blanks 1,count oras 2/3 points.of a rejection and 1/3 of an acceptance (so 75% blanks counts as 50% rejections).
# a. If there are any candidates givennot ''above'' 0rejected by a majority, then eliminate all who aren'tare (thatrejected is,by thosea with half or more ''at'' 0)majority.
#* b. (RepeatIf stepthere 2a,are usingany "atcandidates orsupported belowby a majority, 1"then insteadeliminate ofall "atwho 0"aren't.)
# Give remaining candidates 2 points for each voter who supports them, and 1 point for each who accepts them (or every three who leave them blank).
# The remaining candidate with the highest points wins.
# Highest points wins.
 
Step 2b probably doesn't matter, because any majority-2supported candidate that exists would almost certainly win in step 34 anyway. But step 2b is part of Bucklin voting, which was used in over a dozen US cities during the Progressive era. Also, it lets you say the whole method in one sentence, if the person you're talking to understands medians: "choose the highest score among the candidates with the highest median".
 
Blank votes are counted as 1 or 0 points in proportion to the fraction of all voters who gave the candidate a 2. For example, if there were any candidates without a majority of 0s, a candidate could not win with more than 71% blank votes; because even if the other 29% are all 2-ratings, that would leave 71%*71%=50.41% 0-votes, enough to eliminate.
 
Here's a google spreadsheet to calculate results: [https://docs.google.com/spreadsheets/d/1siFG6XmOZokygY-86EhAKgv8YwzKtTET6AJopyXRqu0/edit#gid=0]. On page 1, it has some examples of how different combinations of ratings would come out, suggesting that it could work well in both [[chicken dilemma]] and [[center squeeze]] scenarios. On page 2, it has some hypothetical results for the Egypt 2012 election, showing that this system could have elected a reformer over Morsi, despite vote-splitting among the various reformers. IRV could have elected Morsi. (Note: the spreadsheet does not actually check step 2b.)
Line 18 ⟶ 17:
Then, to find the second winner, if the first-time winner got 1/3 or more of 2's, first downweight those ballots as if you'd eliminated enough of them to make up 1/3 of the electorate. Otherwise, discard all of the ballots which gave the first-time winner a 2. After downweighting or discarding, run MAS normally.
 
If all the candidates in the first round got a majority of 0's, then you can still find two finalists as explained above. But the voters have sent a messageessage that none of the candidates are good, so one way to deal with the situation would be to have a rule to allow candidates to transfer their 2-votes to new candidates who were not running in the first round, and if those transfers would have made the new candidates finalists, then add them to the second round along with the two finalists who did best in the first round. In that case, since there would be more than 2 candidates in the second round, it would be important to use MAS for the second round too.
 
== Relationship to NOTA ==
Line 28 ⟶ 27:
{{Tenn_voting_example}}
 
Assume voters in each city give their own city 2; any city within 100 miles, 1; any city thatbetween is100 overand 200 miles, awaya or is the farthest city, 0blank; and theany restcity (thosethat betweenis 100 andover 200 miles), get 1away or blankis withthe 50/50farthest chancecity, 0. (These assumptions can be varied substantially without changing the result, but they seem reasonable to start with.)
 
<div class="floatright">
Line 34 ⟶ 33:
!City
!2's
!explicit 1's
!explicit 0's
!blanks
!total 0's+2/3 b's
!score
|-
Anonymous user