| Display title | Minimax Condorcet method |
| Default sort key | Minimax Condorcet method |
| Page length (in bytes) | 6,584 |
| Namespace ID | 0 |
| Page ID | 283 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 4 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Delete | Allow all users (infinite) |
| Page creator | 12.73.132.31 (talk) |
| Date of page creation | 01:18, 23 March 2005 |
| Latest editor | Kristomun (talk | contribs) |
| Date of latest edit | 16:16, 9 April 2024 |
| Total number of edits | 28 |
| Recent number of edits (within past 180 days) | 5 |
| Recent number of distinct authors | 2 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In voting systems, the Minimax Condorcet method (often referred to as "the Minimax method" and sometimes as "minmax" or "min-max") is one of several Condorcet methods used for tabulating votes and determining a winner when using ranked voting in a single-winner election. It is sometimes referred to as the Simpson–Kramer method,[1] and the successive reversal method.[2] |
