Gibbard–Satterthwaite theorem

E494084

The Gibbard–Satterthwaite theorem is a fundamental result in social choice theory showing that every reasonable voting system with at least three options is susceptible to strategic manipulation by voters.

All labels observed (2)

Label Occurrences
Gibbard–Satterthwaite theorem canonical 2
Gibbard's theorem 1

How this entity was disambiguated

Statements (46)

Predicate Object
instanceOf impossibility theorem ⓘ
theorem ⓘ
appliesTo deterministic social choice functions ⓘ
voting systems with at least three alternatives ⓘ
assumes at least three possible outcomes ⓘ
complete and transitive individual preference orderings ⓘ
deterministic social choice rule ⓘ
unrestricted domain of preferences ⓘ
author Allan Gibbard ⓘ
Mark Satterthwaite ⓘ
concerns manipulability of voting rules ⓘ
strategic voting ⓘ
strategy-proofness ⓘ
concludes every such voting rule is either dictatorial or manipulable ⓘ
no strategy-proof, non-dictatorial, onto social choice function exists for three or more alternatives ⓘ
excludes randomized social choice functions ⓘ
field social choice theory ⓘ
voting theory ⓘ
formalizes limits of incentive compatibility in voting ⓘ
hasConsequence any non-dictatorial rule allows some voter to benefit by misrepresenting preferences ⓘ
dictatorship is the only strategy-proof, onto rule with at least three alternatives ⓘ
implies any reasonable voting system with at least three options is vulnerable to strategic manipulation ⓘ
truthful voting cannot be guaranteed in general for non-dictatorial deterministic rules with three or more alternatives ⓘ
influenced development of mechanism design theory ⓘ
research on strategy-proof mechanisms ⓘ
mainClaim every non-dictatorial, deterministic, onto social choice function with at least three alternatives is manipulable ⓘ
namedAfter Allan Gibbard ⓘ
Mark Satterthwaite ⓘ
publishedIn Journal of Economic Theory ⓘ
relatedConcept dictatorship ⓘ
manipulability ⓘ
onto social choice function ⓘ
preference profile ⓘ
social choice function ⓘ
strategy-proofness ⓘ
relatesTo Arrow's impossibility theorem ⓘ
Gibbard's theorem ⓘ
Satterthwaite's theorem ⓘ
topic collective decision-making ⓘ
mechanism design ⓘ
preference aggregation ⓘ
usedIn analysis of political elections ⓘ
computational social choice ⓘ
design of voting protocols ⓘ
multi-agent systems ⓘ
yearProved 1973 ⓘ

How these facts were elicited

Referenced by (3)

Full triples — surface form annotated when it differs from this entity's canonical label.

Arrow’s impossibility theorem → relatedTo → Gibbard–Satterthwaite theorem ⓘ
Gibbard–Satterthwaite theorem → relatesTo → Gibbard's theorem ⓘ
linked to: Gibbard–Satterthwaite theorem
social choice theory → hasKeyConcept → Gibbard–Satterthwaite theorem ⓘ