Information for "Copeland's method"

Jump to navigation Jump to search

Basic information

Display titleCopeland's method
Default sort keyCopeland's method
Page length (in bytes)7,965
Page ID116
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page4
Counted as a content pageYes
Number of subpages of this page0 (0 redirects; 0 non-redirects)

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
DeleteAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>WikipediaBot
Date of page creation20:02, 26 January 2005
Latest editorKristomun (talk | contribs)
Date of latest edit12:12, 24 November 2021
Total number of edits28
Total number of distinct authors7
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (15)

Templates used on this page:

Page transcluded on (1)

Template used on this page:

SEO properties

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]
Information from Extension:WikiSEO