Information for "Smith set"

Basic information

Display titleSmith set
Default sort keySmith set
Page length (in bytes)18,614
Page ID418
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page3
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:37, 26 January 2005
Latest editorRobLa (talk | contribs)
Date of latest edit10:46, 16 May 2021
Total number of edits35
Total number of distinct authors9
Recent number of edits (within past 180 days)2
Recent number of distinct authors1

Page properties

Transcluded templates (3)

Templates used on this page:

SEO properties



Article description: (description)
This attribute controls the content of the description and og:description elements.
The Smith set, Condorcet top tier, or top cycle, is the smallest group of candidates such that more voters prefer any candidate in the group over anyone not in the group (when looking at pairwise matchups). Voting methods which always select the winner from the Smith set are called Smith-efficient, pass the Smith criterion, and are all Condorcet methods, since the Condorcet winner will always be the only candidate in the Smith set when they exist, thus they will be the only candidate eligible to win and so must be picked.
Information from Extension:WikiSEO