Majority Choice Approval: Difference between revisions

Line 7:
If one and only one candidate is given the highest rating by an [[absolute majority]] of voters, that candidate wins. If not, the second-highest rating is added to each candidate's vote total; again, if there is only one candidate with a majority they win. This process continues until some candidate has a majority.
 
Unfortunately, unlessif voters cluster in certain categories (e.g. if there are manyonly categories,a andhandful votersof doratings, notor clusterif atratings roundare numbersclustered (e.g.at multiples of 5 or 10), this procedure is likely to end up with multiple candidates reaching a majority at the same rating. Therefore, a tiebreaking procedure is needed. Some possible resolution methods include:
 
* MCA-A: Most approved candidate (most votes above lowest possible rating). This is also called "Majority Top//Approval", or MTA.
Line 15:
* MCA-M: Candidate with the highest score at the rating level where an absolute majority first appears. This system is equivalent to traditional [[Bucklin voting]].
 
* MCA-S: [[Range voting|Range]] or Score winner. The candidate with the highest average (mean) score is declared winner, where candidates are given 0 points for the lowest rating (not rank), 1 point for the second-lowest, etc.
 
* MCA-R: Runoff. Two finalists are chosen by one of the methods above or an equality-allowed Condorcet method over the given ballots. The finalists are then measured against each other using one of the following methods:
Line 25:
 
== Criteria compliances ==
All MCA variants satisfy the [[Plurality criterion]], the [[Majoritymajority criterion for solid coalitions]], [[Monotonicity criterion|Monotonicitymonotonicity]] (for MCA-AR, assuming first- and second- round votes are consistent), and [[Minimal Defense criterion|Minimal Defense]] (which implies satisfaction of the [[Strong Defensive Strategy criterion]]).
 
All of the methods are [[Summability criterion|summable]] for counting at the precinct level. Only MCA-IR actually requires a matrix (or, possibly two counting rounds), and is thus "[[Summability criterion|summable for k=2]]"; the others require only O(N) tallies, and are thus "[[Summability criterion|summable for k=1]]".