| Display title | FpA-fpC |
| Default sort key | FpA-fpC |
| Page length (in bytes) | 5,948 |
| Namespace ID | 0 |
| Page ID | 2805 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 1 |
| 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 | Kristomun (talk | contribs) |
| Date of page creation | 21:25, 22 August 2020 |
| Latest editor | Kristomun (talk | contribs) |
| Date of latest edit | 16:46, 22 July 2023 |
| Total number of edits | 19 |
| Recent number of edits (within past 180 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | fpA-fpC (for first preference A minus first preference C) is a three-candidate Condorcet method based on first preference Copeland. It was first proposed by Kristofer Munsterhjelm in 2016.[1] Its election cases are: |
