View source for Majority Acceptable Score voting

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 give each candidate 0, 1, or 2 points. 
* If there are any candidates given ''above'' 0 by a majority, then all who aren't (that is, those with a majority ''at'' 0) are eliminated.
** (Do the same for 1. This probably doesn't matter, because a majority-2 candidate would probably 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.) 
* The remaining candidate with the highest points wins.

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.

== An example ==

{{Tenn_voting_example}}

Assume voters in each city give their own city 2; any city within 100 miles, 1; any city that is over 200 miles away or is the farthest city, 0; and the rest (those between 100 and 200 miles), get 0 or 1 with 50/50 chance.

<div class="floatright">
{| border=1
!City
!2's
!explicit 1's
!explicit 0's
!blanks
!total 0's
!score
|-
!bgcolor="#fff"|Memphis
|bgcolor="#fff"|42
|bgcolor="#fff"|0
|bgcolor="#fcc"|58
|bgcolor="#fff"|0
|bgcolor="#fcc"|58
|bgcolor="#fff"|(84)
|-
!bgcolor="#fff"|Nashville
|bgcolor="#fff"|26
|bgcolor="#fff"|37
|bgcolor="#fff"|0
|bgcolor="#fff"|37
|bgcolor="#cfc"|27.4
|bgcolor="#bfb"|98.6
|-
!bgcolor="#fff"|Chattanooga
|bgcolor="#fff"|15
|bgcolor="#fff"|30
|bgcolor="#fff"|21
|bgcolor="#fff"|42
|bgcolor="#cfc"|49.9
|bgcolor="#fff"|65.1
|-
!bgcolor="#fff"|Knoxville
|bgcolor="#fff"|17
|bgcolor="#fff"|28
|bgcolor="#fff"|42
|bgcolor="#fff"|13
|bgcolor="#fcc"|52.8
|bgcolor="#fff"|(64.2)
|}
</div>

Memphis and Knoxville are both given 0 by a majority, so they are eliminated. Of the remaining two, Nashville has a higher score 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 as long as under half of those who had given 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 systems]]