Majority Acceptable Score voting: Difference between revisions

imported>Homunq
No edit summary
 
(12 intermediate revisions by 2 users not shown)
Line 1:
Majority Acceptable Score voting works as described below. Technically speaking, it's the [[graded Bucklin]] method which uses [[Three-level ballots|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't (that is, those with a majority ''at'' 0)are.
#* b. (If there are any candidates supported by a majority, then eliminate all who aren't.)
** (Do the same for 1. This probably doesn't matter, because any majority-2 candidate that exists would almost certainly win in the next step anyway. But this step is part of Bucklin voting, which was used in over a dozen US cities during the Progressive era, and thus it gives this method a stronger pedigree, and makes it easier to model mathematically.)
# 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 (Do the same for 1. This2b probably doesn't matter, because any majority-2supported candidate that exists would almost certainly win in the next step 4 anyway. But this step 2b is part of Bucklin voting, which was used in over a dozen US cities during the Progressive era. Also, andit thuslets ityou givessay the thiswhole method ain strongerone pedigreesentence, andusing makesthe itidea easierof tomedians: model"choose mathematically.)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, 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.)
 
== As the first round of a two-round system ("MAS with runoff") ==
 
If this system is used as the first round of a two-round runoff, then you want to use it to elect at two finalists in the first round. Thus, run the system twice. The first time, instead of eliminating any candidates with a majority below a threshold (as long as there are any with a majority above the threshold), eliminate only those with over 2/3 below the threshold (as long as there are any with 1/3 above).
 
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 essage 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 ==
 
As discussed in the above section, if all the candidates in the first round got a majority of 0's, then the voters have sent a message that none of the candidates are good, akin to a result of "[[none of the above]]" (NOTA). MAS still gives a winner, but it might be good to have a rule that such a winner could only serve one term, or perhaps a softer rule that if they run for the same office again, the information of what percent of voters gave them a 0 should be next to their name on the ballot
 
== An example ==
Line 14 ⟶ 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 20 ⟶ 33:
!City
!2's
!explicit 1's
!explicit 0's
!blanks
!total 0's+2/3 b's
!score
|-
Line 36 ⟶ 49:
!bgcolor="#fff"|Nashville
|bgcolor="#fff"|26
|bgcolor="#fff"|37
|bgcolor="#fff"|0
|bgcolor="#fff"|370
|bgcolor="#cfcfff"|27.474
|bgcolor="#bfbcfc"|9849.67
|bgcolor="#bfb"|76.3
|-
!bgcolor="#fff"|Chattanooga
|bgcolor="#fff"|15
|bgcolor="#fff"|3017
|bgcolor="#fff"|21
|bgcolor="#fff"|42
|bgcolor="#cfcfff"|49.926
|bgcolor="#ffffcc"|6559.17
|bgcolor="#fff"|37(75.7)
|-
!bgcolor="#fff"|Knoxville
|bgcolor="#fff"|17
|bgcolor="#fff"|2815
|bgcolor="#fff"|42
|bgcolor="#fff"|1326
|bgcolor="#fcc"|5259.87
|bgcolor="#fff"|(6477.27)
|}
</div>
 
Memphis is explicitly given 0 by a majority, and is eliminated. Chattanooga and Knoxville are both given 0 by a majority implicitly, so they are eliminated. Of the remaining two, Nashville has a higher scoreremains and wins.
 
If Memphis voters tried to strategize by rating Nashville and Chattanooga at 0 in the above scenario, it would take a bit over half of them to successfully execute the strategy. Even if all the Memphis voters strategized, Chattanooga and Knoxville voters could protect Nashville against this strategy asif long as under half2/3 of thosethem who had givengave Nashville a blank above switched to giving it a 1 (or a 2). Note that the offensive strategy involves moving a natural 1 down to the extreme value of 0, but the defensive strategy only means changing a lazy blank to a natural 1 (not to the extreme value of 2).
 
[[Category:Graded Bucklin systemsmethods]]