Minimax Condorcet method: Difference between revisions

Rephrase information about MMPO tiebreaker to show it's used in other contexts as well.
(Incorporate citations from the Minimax Condorcet talk page, and rewrite the intro paragraph to refer to both Simpson-Kramer and least/successive reversal.)
(Rephrase information about MMPO tiebreaker to show it's used in other contexts as well.)
Line 13:
MMPO's choice rule can be regarded as a kind of social optimization: The election of the candidate to whom fewest people prefer another. That choice rule can be offered as a standard in and of itself.
 
Minmax may be indecisive, particularly for small electorates, because it only considers a single pairwise contest for each candidate. This tendency to tie can be broken by a ''leximax'' tiebreaker: if two or more candidates have the same strength greatest defeat, then elect the one that has the least next-greatest defeat. Repeat as needed.
MMPO's simple tiebreaker:
 
Minmax with a leximax tiebreaker is sometimes called '''Ext-Minmax''' on the [[election-methods mailing list]]. It is the standard tiebreaker for MMPO as defined by Mike Ossipoff.
If two or more candidates have the same greatest pairwise opposition, then elect the one that has the lowest next-greatest pairwise opposition. Repeat as needed.
 
== Criterion compliances ==
1,202

edits