Information for "Talk:Kemeny–Young method"

Jump to navigation Jump to search

Basic information

Display titleTalk:Kemeny–Young method
Default sort keyKemeny–Young method
Page length (in bytes)915
NamespaceTalk
Page ID1935
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page1
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 creatorBetterVotingAdvocacy (talk | contribs)
Date of page creation22:57, 17 March 2020
Latest editorRobLa (talk | contribs)
Date of latest edit19:41, 20 August 2020
Total number of edits3
Total number of distinct authors2
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
User:VoteFair, does Kemeny-Young have any variants that consider the possibility of an equal ranking of the candidates? For example, with 3 candidates, A, B, and C, does Kemeny-Young limit itself to considering the distance scores for the rankings A>B>C, A>C>B, B>C>A, B>A>C, C>A>B, C>B>A, or could it also consider the possibility of, say, A=B>C or B=C>A?
Information from Extension:WikiSEO