Maximize Affirmed Majorities: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 1:
'''Maximize Affirmed Majorities''' (MAM) is a [[voting method]] developed by Stephen Eppley that selects a single winner using votes that express each voter's order of preference. MAM also constructs the complete order of finish, and is defined in terms of constructing the "best" order of finish.
A simple summary of it is that it looks at all [[Pairwise matchup|pairwise matchups]], orders them from strongest (largest) to weakest (smallest), and starting from the first defeat, fixes the winner of the pairwise matchup higher in the [[Order of finish|order of finish]] than the loser, and repeats this for all successive defeats (if doing this for a particular defeat would contradict a previous fixed ranking, then that defeat is ignored). The winner is the candidate or candidate(s) who are in 1st place in the constructed order of finish.
MAM is a [[Condorcet method]]. If there is a candidate X who, for every other candidate Y, is ranked by a majority over Y, then X will be elected. In other words, MAM will place X atop the order of finish. Such a candidate is a Condorcet winner, and requiring it be elected (when it exists) is the Condorcet criterion.
| |||