Jump to content

Minimax Condorcet method: Difference between revisions

Incorporate citations from the Minimax Condorcet talk page, and rewrite the intro paragraph to refer to both Simpson-Kramer and least/successive reversal.
(Moved criterion compliance information to a separate section, and added DMTBR criterion failure to it.)
(Incorporate citations from the Minimax Condorcet talk page, and rewrite the intro paragraph to refer to both Simpson-Kramer and least/successive reversal.)
Line 1:
{{Wikipedia|Minimax Condorcet method}}
 
'''Minmax''' or Minimax method, also referred to as the '''Simpson-Kramer method''',<ref name="Caplin Nalebuff 1988 pp. 787–814">{{cite journal | last=Caplin | first=Andrew | last2=Nalebuff | first2=Barry | title=On 64%-Majority Rule | journal=Econometrica | publisher=[Wiley, Econometric Society] | volume=56 | issue=4 | year=1988 | issn=00129682 | jstor=1912699 | pages=787–814 | url=https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=c10e05dc6ea7cfa1ba1b28aa6c54e7abbf96eccc | access-date=2023-05-27}}</ref> is the name of a class of election methods based on electing the candidate with the most consistently high performance in pairwise contests with other candidates. It is sometimes also called the '''least reversal''' or '''successive reversal''' method,<ref>{{cite web|url=http://lists.electorama.com/pipermail/election-methods-electorama.com/2003-August/075781.html|title=the name of the rose|website=Election-methods mailing list archives|date=2003-08-04|last=Green-Armytage|first=J. }}</ref> although this term is ambiguous.
'''Minmax''' or Minimax (Simpson-Kramer method) is the name of several election methods based on electing the candidate with the lowest score, based on votes received in pairwise contests with other candidates.
 
'''Minmax(winning votes)''' elects the candidate whose greatest pairwise loss to another candidate is the least, when the strength of a pairwise loss is measured as the number of voters who voted for the winning side.
1,215

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.