| Display title | User:BetterVotingAdvocacy/Self-referential Smith-efficient Condorcet method |
| Default sort key | BetterVotingAdvocacy/Self-referential Smith-efficient Condorcet method |
| Page length (in bytes) | 3,900 |
| Namespace ID | 2 |
| Namespace | User |
| Page ID | 1936 |
| Page content language | en - English |
| Page content model | wikitext |
| User ID | 60 |
| Indexing by robots | Allowed |
| Number of redirects to this page | 1 |
| 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 | BetterVotingAdvocacy (talk | contribs) |
| Date of page creation | 00:28, 18 March 2020 |
| Latest editor | RobLa (talk | contribs) |
| Date of latest edit | 01:25, 28 April 2022 |
| Total number of edits | 6 |
| Recent number of edits (within past 180 days) | 0 |
| Recent number of distinct authors | 0 |
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). |
