Majority Choice Approval: Difference between revisions

m
no edit summary
No edit summary
mNo edit summary
(9 intermediate revisions by 3 users not shown)
Line 1:
'''Majority Choice Approval''' ('''MCA''') is a class of rated voting systems which attempt to find majority support for some candidate. It is closely related to Bucklin Voting, which refers to ranked systems using similar rules. In fact, some people consider MCA a subclass of Bucklin, calling it '''[[ER-Bucklin]]''' (for Equal-Ratings-[allowed] Bucklin).
 
== How does it work? ==
 
Voters rate candidates into a fixed number of rating classes. There are commonly 3categories, 4, 5, or even 100 possible rating levelse.g. The following discussion assumes 3 ratings"Good, called" "preferred"Neutral, "approved", and "unapproved"Bad."
 
If one and only one candidate is preferredgiven the highest rating by an [[absolute majority]] of voters, that candidate wins. If not, approvalsthe aresecond-highest rating is added to preferences,each candidate's vote andtotal; again, if there is only one candidate with a majority they win. This process continues until some candidate has a majority.
 
Unfortunately, if voters cluster in certain categories (e.g. if there are only a handful of ratings, or if ratings are clustered 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:
If the election is still unresolved, one of two things must be true. Either multiple candidates attain a majority at the same rating level, or there are no candidates with an absolute majority at any level. In either case, there are different ways to resolve between the possible winners - that is, in the former case, between those candidates with a majority, or in the latter case, between all candidates.
 
The possible resolution methods include:
 
* MCA-A: Most approved candidate (most votes above lowest possible rating). This is also called "Majority Top//Approval", or MTA.
 
* MCA-P: Most preferred candidate (most votes at highest possible rating).
 
* MCA-M: Candidate with the highest score at the rating level where an absolute majority first appears, or MCA-A if there are no majorities. This is the system closest to traditional [[Bucklin voting]].
 
* MCA-S: [[Range voting|Range]] or Score winner. That is, the candidate with the highest score, counting (in the case of 3 ranking levels) 2 points for each preference and 1 point for each approval.
 
* MCA-M: Candidate with the highest score at the rating level where an absolute majority first appears, or MCA-A if there are no majorities. This system is the system closestequivalent to traditional [[Bucklin voting]].
* MCA-R: Runoff - Two "finalists" are chosen by one or two methods, such as one of the methods above or a equality-allowed Condorcet method over the given ballots. The finalists are then measured against each other using one of the following methods:
 
* MCA-S: [[Range voting|Range]] or Score winner. That is, theThe candidate with the highest score, countingaverage (inmean) thescore caseis ofdeclared 3winner, rankingwhere levels)candidates 2are given 0 points for eachthe preferencelowest andrating (not rank), 1 point for eachthe second-lowest, approvaletc.
** MCA-IR: Instant runoff (Condorcet-style, using ballots): Ballots are recounted for whichever one of the finalists they rate higher. Ballots which rate both candidates at the same level are counted for neither.
 
* MCA-R: Runoff -. Two "finalists" are chosen by one or two methods, such as one of the methods above or aan equality-allowed Condorcet method over the given ballots. The finalists are then measured against each other using one of the following methods:
** MCA-IR: Ballots are counted for whichever one of the finalists they rate higher.
** MCA-AR: Actual runoff: Voters return to the polls to choose one of the finalists. This has the advantage that one candidate is guaranteed to receive the absolute majority of the valid votes in the last round of voting of the system as a whole.
 
Line 29 ⟶ 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]]".
 
TheMCA fails the [[Participationparticipation criterion]] and its stronger cousin the [[Consistencyconsistency criterion]], as well as the [[Laterlater-no-harm criterion]] are not satisfied by any MCA variant, although MCA-P only fails Participationparticipation if the additional vote causes an approval majority.
 
MCA can also satisfy:
Other criteria are satisfied by some, but not all, MCA variants. To wit:
 
* [[Independence of irrelevant alternatives]]
* [[Strategic nomination|Clone Independence]] is satisfied by most MCA versions. In fact, even the stronger [[Independence of irrelevant alternatives]] is satisfied by MCA-A, MCA-P, MCA-M, and MCA-S. Clone independence is satisfied along with the weaker and related [[ISDA]] by MCA-IR and MCA-AR, if ISDA-compliant Condorcet methods (ie, [[Schulze]]) are used to choose the two "finalists". Using simpler methods (such as MCA itself) to decide the finalists, MCA-IR and MCA-AR are not strictly clone independent.
 
* TheMCA-IR satisfies [[Condorcet criterion|Condorcet]] is satisfied by MCA-IR if the [[pairwise champion]] (aka CW) is visible on the ballots{{Clarify|date=April 2024}} and would beat at least one other candidate by an absolute majority. It is satisfied by MCA-AR if at least half the voters at least approve the PC in the first round of voting. These methods also satisfy the [[Strategy-Free criterion]] if an SFC-compliant method such as [[Schulze]] is used to pick at least one of the finalists. All other MCA versions, however, fail the Condorcet and strategy-free criteria.
 
* The [[Laterlater-no-help criterion]] and the [[Favorite Betrayal criterion]] are satisfied by MCA-P. They're also satisfied by MCA-AR if MCA-P is used to pick the two finalists.
 
* MCA-AR satisfies the [[Guaranteedguaranteed majority criterion]], a criterion which can only be satisfied by a multi-round (runoff-based) method.
 
Thus, the MCA method which satisfies the most criteria is MCA-AR, using [[Schulze]] over the ballots to select one finalist and MCA-P to select the other. Also notable are MCA-M and MCA-P, which, as ''rated'' methods (and thus ones which fail Arrow's ''ranking''-based [[Universalityuniversality criterion]]), are able to seem to "violate [[Arrow's Theorem]]" by simultaneously satisfying monotonicity and [[independence of irrelevant alternatives]] (as well as of course sovereignty and non-dictatorship).
 
== An example ==
Line 90 ⟶ 86:
 
== Notes ==
MCA ballots can be modified to do [[Smith//Approval]] with the use of an [[approval threshold]]. Limiting the number of allowed rankings in Smith//Approval makes it closer in design to [[Approval voting]] than to most [[Condorcet method]]<nowiki/>s.
 
[[Category:Single-winner voting methods]]
[[Category:Graded Bucklin methods]]
[[Category:No-favorite-betrayal electoral systems]]
[[Category:Monotonic electoral systems]]
1,196

edits