Information for "Gibbard-Satterthwaite theorem"

Jump to navigation Jump to search

Basic information

Display titleGibbard-Satterthwaite theorem
Default sort keyGibbard-Satterthwaite theorem
Page length (in bytes)878
Page ID181
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:10, 26 January 2005
Latest editorDr. Edmonds (talk | contribs)
Date of latest edit23:59, 25 January 2020
Total number of edits7
Total number of distinct authors5
Recent number of edits (within past 180 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (2)

Templates used on this page:

SEO properties

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 related to Arrow's impossibility theorem and the Balinski–Young theorem.
Information from Extension:WikiSEO