Information for "Dodgson's method"

Jump to navigation Jump to search

Basic information

Display titleDodgson's method
Default sort keyDodgson's method
Page length (in bytes)2,850
Page ID1805
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page1
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 creatorPsephomancy (talk | contribs)
Date of page creation16:03, 27 February 2020
Latest editorKristomun (talk | contribs)
Date of latest edit14:06, 25 August 2020
Total number of edits7
Total number of distinct authors2
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (10)

Templates used on this page:

Page transcluded on (1)

Template used on this page:

SEO properties



Article description: (description)
This attribute controls the content of the description and og:description elements.
Dodgson's method is a Condorcet method that ranks a candidate X according to the number of times adjacent candidates have to be swapped on a ballot (not necessarily the same ballot each time) to make X the Condorcet winner. The candidate with the least number of necessary swaps wins.
Information from Extension:WikiSEO