Information for "User:BetterVotingAdvocacy/Self-referential Smith-efficient Condorcet method"

Basic information

Display titleUser:BetterVotingAdvocacy/Self-referential Smith-efficient Condorcet method
Default sort keyBetterVotingAdvocacy/Self-referential Smith-efficient Condorcet method
Page length (in bytes)3,900
NamespaceUser
Page ID1936
Page content languageen - English
Page content modelwikitext
User ID60
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 creation00:28, 18 March 2020
Latest editorRobLa (talk | contribs)
Date of latest edit01:25, 28 April 2022
Total number of edits6
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.
Self-referential Condorcet methods (SR-Condorcet methods) guarantee the election of a candidate, the SR-Condorcet winner, who would win within the voting method if it was just them and any other candidate, when one exists (related to a Condorcet winner). More broadly, if there are a smallest set of candidates, the SR-Smith set, who would each win if it was just them and any other candidate not in the set, some voting methods always elect someone from this set of candidates (related to the Smith set).
Information from Extension:WikiSEO