Information for "Smith criterion"

Basic information

Display titleSmith criterion
Default sort keySmith criterion
Page length (in bytes)4,351
Namespace ID0
Page ID178
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page4
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:08, 26 January 2005
Latest editorRobLa (talk | contribs)
Date of latest edit07:19, 23 November 2021
Total number of edits22
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

Page properties

Transcluded template (1)

Template used on this page:

SEO properties



Article description: (description)
This attribute controls the content of the description and og:description elements.
Any election method that complies with the Smith criterion also complies with the Condorcet winner criterion, since if there is a Condorcet winner, then that winner is the only member of the Smith set. Voting methods that pass the Smith criterion are called "Smith-efficient" (or often "Smith-efficient Condorcet methods"). They also pass the mutual majority criterion, as the Smith set will always be a subset of the mutual majority-preferred set of candidates (each of the mutual majority-preferred candidates pairwise beats all non-mutual majority-preferred candidates by a majority, but some of them may pairwise beat each other, so the Smith set will at most be all of them.)
Information from Extension:WikiSEO