| Display title | Copeland's method |
| Default sort key | Copeland's method |
| Page length (in bytes) | 8,389 |
| Namespace ID | 0 |
| Page ID | 116 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 5 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Page views in the past month | 0 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Delete | Allow all users (infinite) |
| Page creator | imported>WikipediaBot |
| Date of page creation | 20:02, 26 January 2005 |
| Latest editor | RobLa (talk | contribs) |
| Date of latest edit | 08:45, 7 November 2023 |
| Total number of edits | 34 |
| 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. | Copeland's method is a Smith-efficient[1] Condorcet method in which the winner is determined by finding the candidate with the most (pairwise victories minus pairwise defeats), known as their Copeland score. It was invented by Ramon Llull in his 1299 treatise Ars Electionis, but his form only counted pairwise victories and not defeats (which could lead to a different result in the case of a pairwise tie).[2] |
