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.

Version: v1 · 2026-09-28 · History
Domain-specific #: 9698
Domain group: Social Sciences
Origin domain: Economics & Finance
Subdomains: Social Choice Theory, Mechanism Design → Economics & Finance

Core Idea¶

Gibbard's theorem is treated here as the recurring social_sciences_humanities_arts identity summarized by this source-grounded definition: In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973.

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. The process is dictatorial, i.e. there exists a single voter whose vote can change the outcome.

The process limits the possible outcomes to two options only. 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.

For Gibbard's theorem, the abstraction is narrower than the article's general subject matter: a positive case must preserve In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in social_sciences_humanities_arts, which is why this identity is domain-specific rather than prime.

Structural Signature¶

Sig role-phrases:

Defining carrier — 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.
Constitutive relation — This property is desirable for a democratic decision process: it means that once the agent i has identified her own preferences P_i , she can choose a strategy s_i^*(P_i) that best defends her preferences, with no need to know or guess the strategies chosen by the other agents.
Operating condition — Gibbard's theorem is itself generalized by Gibbard's 1978 theorem and Hylland's theorem, 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.
Recognition evidence — Ties between candidates are broken by alphabetical order: for example, if there is a tie between candidates a and b , then a wins.
Admissible variation — We let \mathcal{S} = \mathcal{S}_1 \times \cdots \times \mathcal{S}_n and denote by g(\mathcal{S}) the range of g , i.e. the set of the possible outcomes of the game form.
Characteristic consequence — This game form is strategyproof: whatever the preferences of a voter, he has a dominant strategy that consists in declaring his sincere preference order.
Failure boundary — 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.

What It Is Not¶

Not the whole field of social_sciences_humanities_arts. The node requires the specific identity stated by In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973.
Not an over-broad reading. However, it is not strategyproof: the other voters face the same issue of strategic voting as in the usual Borda count.
Not an over-broad reading. However, if we assume instead that the two other voters respectively cast ballots (0, 0, 1) and (0, 1, 1) , then voter 1 should not vote (1, 0, 0) because it makes c win; she should rather vote (1, 1, 0) , which makes b win.
Not an over-broad reading. 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 (unilateral), or if the process limits the outcome to two possible options only (duple).
Not automatically Gibbard–Satterthwaite Theorem. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Gibbard's theorem applies literally inside social_sciences_humanities_arts wherever the source-defined carrier and relation can be established. Its documented habitats include:

Formal statement. Let \mathcal{N} = {1, \ldots, n} be the set of agents, which can also be called players or voters, depending on the context of application.
Formal statement. Let g be a function that, to each n -tuple of strategies (s_1, \ldots, s_n) \in \mathcal{S}_1 \times \cdots \times \mathcal{S}_n , maps an alternative.
ExamplesSerial dictatorship. If there is still several non-eliminated candidates after all ballots have been examined, then an arbitrary tie-breaking rule is used.
Extensions. Gibbard's 1978 theorem states that a nondeterministic voting method is only strategyproof if it's a mixture of unilateral and duple rules.
Extensions. Nondeterministic methods have been devised that approximate the results of deterministic methods while being strategyproof.
Formal statement. The function g is called a game form.

Outside social_sciences_humanities_arts, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Theory or should be marked as analogy.

Clarity¶

A clear use of Gibbard's theorem names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973. The strongest recognition evidence in the frozen account is: Ties between candidates are broken by alphabetical order: for example, if there is a tie between candidates a and b , then a wins. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification However, it is not strategyproof: the other voters face the same issue of strategic voting as in the usual Borda count. so that a reader can reproduce the classification rather than infer it from topical resemblance.

Manages Complexity¶

Gibbard's theorem compresses multiple social_sciences_humanities_arts details into a stable diagnostic relation. The source shows both the central mechanism—this property is desirable for a democratic decision process: it means that once the agent i has identified her own preferences P_i , she can choose a strategy s_i^*(P_i) that best defends her preferences, with no need to know or guess the strategies chosen by the other agents.—and the practical consequence—this game form is strategyproof: whatever the preferences of a voter, he has a dominant strategy that consists in declaring his sincere preference order. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the social_sciences_humanities_arts entities to which the claim applies.
State the relation. Use the source-grounded identity: In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973.
Check operation and conditions. Gibbard's theorem is itself generalized by Gibbard's 1978 theorem and Hylland's theorem, 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.
Demand recognition evidence. Ties between candidates are broken by alphabetical order: for example, if there is a tie between candidates a and b , then a wins.
Test variation. Change an implementation or setting while preserving we let \mathcal{S} = \mathcal{S}_1 \times \cdots \times \mathcal{S}_n and denote by g(\mathcal{S}) the range of g , i.e. the set of the possible outcomes of the game form.
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Theory.

Knowledge Transfer¶

Within the home domain. Knowledge about Gibbard's theorem transfers literally when a new case preserves the same carrier type, relation, and recognition test. Let \mathcal{N} = {1, \ldots, n} be the set of agents, which can also be called players or voters, depending on the context of application. Let g be a function that, to each n -tuple of strategies (s_1, \ldots, s_n) \in \mathcal{S}_1 \times \cdots \times \mathcal{S}_n , maps an alternative.

Beyond the home domain. No canonical parent is asserted for Gibbard's theorem. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

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 case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973; recognition evidence → Ties between candidates are broken by alphabetical order: for example, if there is a tie between candidates a and b , then a wins

Applied / In Practice¶

For example, (1, 1, 0) is an authorized ballot: it means that the voter approves of candidates a and b but does not approve of candidate c . The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → Overview; invariant → In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973; boundary → the case exits the class when however, it is not strategyproof: the other voters face the same issue of strategic voting as in the usual Borda count

Structural Tensions¶

T1 — Stable identity versus admissible variation. However, it is not strategyproof: the other voters face the same issue of strategic voting as in the usual Borda count. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. However, if we assume instead that the two other voters respectively cast ballots (0, 0, 1) and (0, 1, 1) , then voter 1 should not vote (1, 0, 0) because it makes c win; she should rather vote (1, 1, 0) , which makes b win. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. 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 (unilateral), or if the process limits the outcome to two possible options only (duple). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. For example, (1, 1, 0) is an authorized ballot: it means that the voter approves of candidates a and b but does not approve of candidate c . The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. 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. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Gibbard's theorem literally, co-instantiate Theory, or only resemble it?

T6 — Autonomy versus reduction. This property is desirable for a democratic decision process: it means that once the agent i has identified her own preferences P_i , she can choose a strategy s_i^*(P_i) that best defends her preferences, with no need to know or guess the strategies chosen by the other agents. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Gibbard's theorem distinguish that the broader parent Theory leaves together?

Structural–Framed Character¶

Gibbard's theorem is mixed or framed-leaning. Its structural side is the repeatable organization summarized by In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973. Its framed side is the social_sciences_humanities_arts vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: Gibbard's theorem is itself generalized by Gibbard's 1978 theorem and Hylland's theorem, 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. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Theory. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: 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. This property is desirable for a democratic decision process: it means that once the agent i has identified her own preferences Pi , she can choose a strategy si^(Pi) that best defends her preferences, with no need to know or guess the strategies chosen by the other agents. It further constrains recognition and variation through: Gibbard's theorem is itself generalized by Gibbard's 1978 theorem and Hylland's theorem, 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. Ties between candidates are broken by alphabetical order: for example, if there is a tie between candidates a and b , then a wins.

What is domain-bound. social sciences humanities arts supplies the operative entities, technical vocabulary, warrants, and exceptions that make Gibbard's theorem literal. Its documented scope includes the condition that Let \mathcal{N} = {1, \ldots, n} be the set of agents, which can also be called players or voters, depending on the context of application. Another bounded application condition is that Let g be a function that, to each n -tuple of strategies (s1, \ldots, sn) \in \mathcal{S}1 \times \cdots \times \mathcal{S}n , maps an alternative. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—We let \mathcal{S} = \mathcal{S}1 \times \cdots \times \mathcal{S}n and denote by g(\mathcal{S}) the range of g , i.e. the set of the possible outcomes of the game form.—and future graph densification may discover a defensible relation only if it preserves that boundary.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Gibbard's theorem. The reviewed identity is: In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Neighborhood in Abstraction Space¶

Gibbard's theorem sits in a moderately populated region (58^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Political & Strategic Game Models (11 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Theory. The parent omits the specialist differentia. Tell: Can the case establish In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973?
Gibbard–Satterthwaite Theorem. With at least three alternatives and unrestricted strict ordinal preferences, every deterministic onto single-winner rule that makes truthful reporting a dominant strategy is dictatorial. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Median Voter Theorem. Under majority rule with single-peaked preferences on one policy dimension, binary competition converges to the median voter's ideal point, because that position is the unique Condorcet winner — any platform away from it is beaten by one moving closer. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Arrow's Impossibility Theorem. Prove that no ranked-preference voting rule over three or more alternatives can jointly satisfy four minimal fairness axioms — certifying the 'fair in every respect' region of design space empty and reducing the debate to which axiom to knowingly sacrifice. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Gibbard's theorem remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside social_sciences_humanities_arts lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Theory?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Gibbard%27s_theorem (revision 1339091039).
Preserved source candidate: http://www.eecs.harvard.edu/cs286r/courses/fall11/papers/Gibbard73.pdf
Preserved source candidate: https://www.econstor.eu/bitstream/10419/220562/1/cmsems-dp0203.pdf
Preserved source candidate: https://web.archive.org/web/20201103110209/https://www.econstor.eu/bitstream/10419/220562/1/cmsems-dp0203.pdf
Preserved source candidate: https://www.sv.uio.no/econ/personer/vit/aanundh/upubliserte-artikler-og-notater/Strategy%20Proofness%5b1%5d.pdf

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.