| Display title | Condorcet//FPTP |
| Default sort key | Condorcet//FPTP |
| Page length (in bytes) | 3,131 |
| Namespace ID | 0 |
| Page ID | 1756 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| 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 | BetterVotingAdvocacy (talk | contribs) |
| Date of page creation | 13:37, 19 February 2020 |
| Latest editor | Psephomancy (talk | contribs) |
| Date of latest edit | 03:14, 25 December 2023 |
| Total number of edits | 6 |
| Recent number of edits (within past 180 days) | 1 |
| Recent number of distinct authors | 1 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Condorcet//FPTP is a voting method which elects the Condorcet winner if one exists, but otherwise elects the candidate with the most 1st choices (the FPTP winner). It is arguably the simplest possible Condorcet method, even when compared to methods like Minimax and Condorcet-cardinal hybrids. |
