| Display title | Smith criterion |
| Default sort key | Smith criterion |
| Page length (in bytes) | 4,351 |
| Page ID | 178 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 4 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Delete | Allow all users (infinite) |
| Page creator | imported>WikipediaBot |
| Date of page creation | 20:08, 26 January 2005 |
| Latest editor | RobLa (talk | contribs) |
| Date of latest edit | 07:19, 23 November 2021 |
| Total number of edits | 22 |
| Total number of distinct authors | 7 |
| Recent number of edits (within past 180 days) | 0 |
| Recent number of distinct authors | 0 |
| Transcluded template (1) | Template used on this page:
|
Description | Content |
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.) |
