| Display title | Gibbard-Satterthwaite theorem |
| Default sort key | Gibbard-Satterthwaite theorem |
| Page length (in bytes) | 952 |
| Namespace ID | 0 |
| Page ID | 181 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 2 |
| Counted as a content page | Yes |
| Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
| Page views in the past month | 0 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Delete | Allow all users (infinite) |
| Page creator | imported>WikipediaBot |
| Date of page creation | 20:10, 26 January 2005 |
| Latest editor | RobLa (talk | contribs) |
| Date of latest edit | 00:21, 16 June 2024 |
| Total number of edits | 9 |
| Recent number of edits (within past 180 days) | 0 |
| Recent number of distinct authors | 0 |
| Transcluded templates (2) | Templates used on this page:
|
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | The Gibbard-Satterthwaite theorem states that every unimposing voting system (one in which every preference order is achievable) which chooses between three or more candidates, must be either dictatorial or manipulable (i.e. susceptible to tactical voting). It is derived from Arrow's impossibility theorem and Gibbard's theorem. |
