Английская Википедия:Gibbard's theorem
Шаблон:Merge to In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973.[1] It states that for any deterministic process of collective decision, at least one of the following three properties must hold:
- The process is dictatorial, i.e. there is a single voter whose vote chooses the outcome.
- The process limits the possible outcomes to two options only.
- The process is not straightforward; the optimal ballot for a voter 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.Шаблон:NoteTag
Gibbard's theorem is more general, and considers processes of collective decision that may not be ordinal: for example, voting systems where voters assign grades to or otherwise rate candidates (cardinal voting). Gibbard's theorem can be proven using Arrow's impossibility theorem.Шаблон:Citation needed
Gibbard's theorem is itself generalized by Gibbard's 1978 theorem[2] and Hylland's theorem,[3] which extend these results to non-deterministic processes, i.e. where the outcome may not only depend on the agents' actions but may also involve an element of chance.
Gibbard's theorem assumes the collective decision results in exactly one winner and does not apply to multi-winner voting. A similar result for multi-winner voting is the Duggan–Schwartz theorem.
Overview
Consider some voters <math>1</math>, <math>2</math> and <math>3</math> who wish to select an option among three alternatives: <math>a</math>, <math>b</math> and <math>c</math>. Assume they use approval voting: each voter assigns to each candidate the grade 1 (approval) or 0 (withhold approval). For example, <math>(1, 1, 0)</math> is an authorized ballot: it means that the voter approves of candidates <math>a</math> and <math>b</math> but does not approve of candidate <math>c</math>. Once the ballots are collected, the candidate with highest total grade is declared the winner. Ties between candidates are broken by alphabetical order: for example, if there is a tie between candidates <math>a</math> and <math>b</math>, then <math>a</math> wins.
Assume that voter <math>1</math> prefers alternative <math>a</math>, then <math>b</math> and then <math>c</math>. Which ballot will best defend her opinions? For example, consider the two following situations.
- If the two other voters respectively cast ballots <math>(0, 1, 1)</math> and <math>(1, 1, 1)</math>, then voter <math>1</math> has only one ballot that leads to the election of her favorite alternative <math>a</math> : <math>(1, 0, 0)</math>.
- However, if we assume instead that the two other voters respectively cast ballots <math>(0, 0, 1)</math> and <math>(0, 1, 1)</math>, then voter <math>1</math> should not vote <math>(1, 0, 0)</math> because it makes <math>c</math> win; she should rather vote <math>(1, 1, 0)</math>, which makes <math>b</math> win.
To sum up, voter <math>1</math> faces a strategic voting dilemma: depending on the ballots that the other voters will cast, <math>(1, 0, 0)</math> or <math>(1, 1, 0)</math> can be a ballot that best defends her opinions. We then say that approval voting is not strategyproof: once the voter has identified her own preferences, she does not have a ballot at her disposal that best defends her opinions in all situations; she needs to act strategically, possibly by spying over the other voters to determine how they intend to vote.
Gibbard's theorem states that a deterministic process of collective decision cannot be strategyproof, except possibly in two cases: if there is a distinguished agent who has a dictatorial power, or if the process limits the outcome to two possible options only.
Formal statement
Let <math>\mathcal{A}</math> be the set of alternatives, which can also be called candidates in a context of voting. Let <math>\mathcal{N} = \{1, \ldots, n\}</math> be the set of agents, which can also be called players or voters, depending on the context of application. For each agent <math>i</math>, let <math>\mathcal{S}_i</math> be a set that represents the available strategies for agent <math>i</math>; assume that <math>\mathcal{S}_i</math> is finite. Let <math>g</math> be a function that, to each <math>n</math>-tuple of strategies <math>(s_1, \ldots, s_n) \in \mathcal{S}_1 \times \cdots \times \mathcal{S}_n</math>, maps an alternative. The function <math>g</math> is called a game form. In other words, a game form is essentially defined like an n-player game, but with no utilities associated to the possible outcomes: it describes the procedure only, without specifying a priori the gain that each agent would get from each outcome.
We say that <math>g</math> is strategyproof (originally called: straightforward) if for any agent <math>i</math> and for any strict weak order <math>P_i</math> over the alternatives, there exists a strategy <math>s_i^*(P_i)</math> that is dominant for agent <math>i</math> when she has preferences <math>P_i</math>: there is no profile of strategies for the other agents such that another strategy <math>s_i</math>, different from <math>s_i^*(P_i)</math>, would lead to a strictly better outcome (in the sense of <math>P_i</math>). This property is desirable for a democratic decision process: it means that once the agent <math>i</math> has identified her own preferences <math>P_i</math>, she can choose a strategy <math>s_i^*(P_i)</math> that best defends her preferences, with no need to know or guess the strategies chosen by the other agents.
We let <math>\mathcal{S} = \mathcal{S}_1 \times \cdots \times \mathcal{S}_n</math> and denote by <math>g(\mathcal{S})</math> the range of <math>g</math>, i.e. the set of the possible outcomes of the game form. For example, we say that <math>g</math> has at least 3 possible outcomes if and only if the cardinality of <math>g(\mathcal{S})</math> is 3 or more. Since the strategy sets are finite, <math>g(\mathcal{S})</math> is finite also; thus, even if the set of alternatives <math>\mathcal{A}</math> is not assumed to be finite, the subset of possible outcomes <math>g(\mathcal{S})</math> is necessarily so.
We say that <math>g</math> is dictatorial if there exists an agent <math>i</math> who is a dictator, in the sense that for any possible outcome <math>a \in g(\mathcal{S})</math>, agent <math>i</math> has a strategy at her disposal that ensures that the result is <math>a</math>, whatever the strategies chosen by the other agents.
Examples
Serial dictatorship
We assume that each voter communicates a strict weak order over the candidates. The serial dictatorship is defined as follows. If voter 1 has a unique most-liked candidate, then this candidate is elected. Otherwise, possible outcomes are restricted to his ex-aequo most-liked candidates and the other candidates are eliminated. Then voter 2's ballot is examined: if he has a unique best-liked candidate among the non-eliminated ones, then this candidate is elected. Otherwise, the list of possible outcomes is reduced again, etc. If there is still several non-eliminated candidates after all ballots have been examined, then an arbitrary tie-breaking rule is used.
This game form is strategyproof: whatever the preferences of a voter, he has a dominant strategy that consists in declaring his sincere preference order. It is also dictatorial, and its dictator is voter 1: if he wishes to see candidate <math>a</math> elected, then he just has to communicate a preference order where <math>a</math> is the unique most-liked candidate.
Simple majority vote
If there are only 2 possible outcomes, a game form may be strategyproof and not dictatorial. For example, it is the case of the simple majority vote: each voter casts a ballot for her most-liked alternative (among the two possible outcomes), and the alternative with most votes is declared the winner. This game form is strategyproof because it is always optimal to vote for one's most-liked alternative (unless one is indifferent between them). However, it is clearly not dictatorial. Many other game forms are strategyproof and not dictatorial: for example, assume that the alternative <math>a</math> wins if it gets two thirds of the votes, and <math>b</math> wins otherwise.
A game form showing that the converse does not hold
Consider the following game form. Voter 1 can vote for a candidate of her choice, or she can abstain. In the first case, the specified candidate is automatically elected. Otherwise, the other voters use a classic voting rule, for example the Borda count. This game form is clearly dictatorial, because voter 1 can impose the result. However, it is not strategyproof: the other voters face the same issue of strategic voting as in the usual Borda count. Thus, Gibbard's theorem is an implication and not an equivalence.
Notes and references
See also
