Information for "Kemeny–Young method"

Jump to navigation Jump to search

Basic information

Display titleKemeny–Young method
Default sort keyKemeny–Young method
Page length (in bytes)3,723
Page ID217
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page2
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>Allens
Date of page creation21:29, 5 November 2005
Latest editorApparently my name violates the rules (talk | contribs)
Date of latest edit23:21, 25 February 2021
Total number of edits20
Total number of distinct authors8
Recent number of edits (within past 180 days)1
Recent number of distinct authors1

Page properties

Transcluded templates (2)

Templates used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
Each possible complete ranking of the candidates is given a "distance" score. For each pair of candidates, find the number of ballots that order them the opposite way as the given ranking. The distance is the sum across all such pairs. The ranking with the least distance wins.
Information from Extension:WikiSEO