Gibbard's theorem in the context of "Ranked voting"

Play Trivia Questions online!

or

Skip to study material about Gibbard's theorem in the context of "Ranked voting"

Ad spacer

⭐ Core Definition: Gibbard's theorem

In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973. It states that for any deterministic process of collective decision, at least one of the following three properties must hold:

  1. The process is dictatorial, i.e. there is a single voter whose vote chooses the outcome.
  2. The process limits the possible outcomes to two options only.
  3. The process is not straightforward; the optimal ballot for a voter "requires strategic voting", i.e. it depends on their beliefs about other voters' ballots.

A corollary of this theorem is the Gibbard–Satterthwaite theorem about voting rules. The key difference between the two theorems is that Gibbard–Satterthwaite applies only to ranked voting. Because of its broader scope, Gibbard's theorem makes no claim about whether voters need to reverse their ranking of candidates, only that their optimal ballots depend on the other voters' ballots.

↓ Menu

>>>PUT SHARE BUTTONS HERE<<<
In this Dossier

Gibbard's theorem in the context of Strategic voting

Strategic or tactical voting is voting in consideration of possible ballots cast by other voters in order to maximize one's satisfaction with the election's results.

Gibbard's theorem shows that no voting system has a single "always-best" strategy, i.e. one that always maximizes a voter's satisfaction with the result, regardless of other voters' ballots. This implies all voting systems can sometimes encourage voters to strategize. However, weaker guarantees can be shown under stronger conditions. Examples include one-dimensional preferences (where the median rule is strategyproof) and dichotomous preferences (where approval or score voting are strategyproof).

↑ Return to Menu