Skip to content

Banzhaf power index

A voting-power measure based on how often a voter is critical in winning coalitions, normalized either across that voter's possible swings or across all voters' swings.

Version
v2 · 2026-09-19 · History
Domain-specific #
3409
Domain group
Social Sciences
Origin domain
Economics & Finance
Subdomain
Cooperative Game Theory and Collective Choice → Economics & Finance

Core Idea

The index distinguishes formal voting weight from pivotal influence and depends on quota, coalition model, normalization, independence assumptions, and whether absolute or relative power is reported.[3] All coalitions or vote profiles are enumerated under a declared probability model; removing or flipping one voter tests whether the outcome changes, and critical occurrences are counted and normalized. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of cooperative game theory and collective choice. It is the domain-specific identity determined by the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test. This gives the entry an operational identity rather than merely a historical label.

A useful analysis keeps three layers separate. The constitutive layer says what must be true: the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit. The evidential layer asks what observation or proof warrants the claim: type the carrier, state every parameter and convention in the definition, test that the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. The use layer asks what reasoning becomes available once the identity is established: recognizing and comparing instances of Banzhaf power index, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Conflating the layers is the most common source of scope inflation.

How would you explain it like I'm…

Whose Vote Flips It?

Imagine a club where some kids get more votes than others. To see how powerful you really are, look at every way the club could vote and count the times your vote alone would flip the answer. Having lots of votes does not always mean you are the one who decides.

Counting Swing Votes

In some groups, members have different numbers of votes, and a plan passes if it gets enough votes, called the quota. The Banzhaf power index measures real voting power by checking every possible group of yes-voters and counting how often a member is the swing voter: if that member switched, the result would change. A member with many votes can still rarely be the swing voter, and a member with few votes can matter a lot. The counts can be turned into shares so everyone's power adds up to a whole. The answer depends on the rules, like the quota and how the groups are counted.

Pivotal Voting Power Index

The Banzhaf power index measures voting power in a weighted voting system, where each voter has a weight and a proposal passes if the supporting weight reaches a quota. It separates formal weight from pivotal influence. The method goes through all possible coalitions, or all possible patterns of yes/no votes, and for each voter counts how many times removing or flipping that voter changes the outcome; those are the times the voter is critical, or a 'swing'. The counts can be reported as an absolute index (often read as a probability of being decisive under a stated assumption, like every coalition being equally likely) or normalized so everyone's shares add to 1. A voter who is never critical is a null player with zero power, even if they hold votes. The answer depends on the quota, the probability model, and which version is reported, so those must be stated.

 

The Banzhaf power index quantifies a voter's a priori influence in a voting game by counting how often that voter is critical. Given players with voting weights, a quota and winning rule, and a sample space of coalitions (or binary vote profiles) with a declared probability model, one enumerates the cases and tests for each player whether removing them from a winning coalition, or flipping their vote, changes the outcome. The number of such swings is then reported either in absolute form, typically normalized by the number of coalitions of the other players so it can be read as a probability of decisiveness under independence assumptions, or in relative form, normalized so the indices of all players sum to one. The index makes precise the gap between formal weight and pivotal influence: weights can be very unequal while powers are equal, and a player with positive weight can be a null player who is never critical. Because results depend on the quota, coalition model, normalization, and independence assumptions, a valid analysis states them all, along with the computational method, since exact enumeration grows exponentially with the number of players.

Structural Signature

  • Carrier: the typed cooperative game theory and collective choice carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets
  • Inputs or antecedent state: the exact cooperative game theory and collective choice carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Banzhaf power index
  • Constitutive operation: All coalitions or vote profiles are enumerated under a declared probability model; removing or flipping one voter tests whether the outcome changes, and critical occurrences are counted and normalized.
  • Invariant: the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit
  • Recognition test: type the carrier, state every parameter and convention in the definition, test that the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases
  • Output or consequence: recognizing and comparing instances of Banzhaf power index, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions
  • Failure boundary: the carrier is mistyped, the condition that the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test

What It Is Not

  • It is not the whole field of cooperative game theory and collective choice. The field contains many questions and methods that do not instantiate Banzhaf power index.
  • It is not its most familiar example. A canonical instance directly demonstrates that the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit. exhibits the structure, but the example is evidence for the abstraction rather than its definition.
  • It is not the neighboring catalog concept Shapley-Shubik power index. Shapley-Shubik measures pivotality across all voter orderings; Banzhaf measures swings across coalitions or equiprobable vote profiles.
  • It is not a claim that every boundary case has one uncontested classification. a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Banzhaf power index must control the decision
  • It is not an unrestricted metaphor for any process that seems similar. Outside cooperative game theory and collective choice, the vocabulary and validity conditions do not transfer literally.

Scope of Application

Banzhaf power index belongs to cooperative game theory and collective choice and is useful where the analyst can specify the typed cooperative game theory and collective choice carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit. The scope is broad within that domain but bounded by the need for the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.[1]

  • Definition and recognition. Determine whether a proposed instance satisfies the constitutive conditions rather than merely sharing terminology.
  • Construction or evolution. Track how the exact cooperative game theory and collective choice carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Banzhaf power index are converted, constrained, or organized by All coalitions or vote profiles are enumerated under a declared probability model; removing or flipping one voter tests whether the outcome changes, and critical occurrences are counted and normalized..
  • Comparison. Compare instances using carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior, without treating convenience measures as the definition.
  • Boundary analysis. Diagnose cases where a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Banzhaf power index must control the decision and state which convention or theorem controls the decision.
  • Downstream reasoning. Use the established identity to support recognizing and comparing instances of Banzhaf power index, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions while preserving the assumptions under which the inference is valid.

Clarity

The abstraction clarifies a crowded vocabulary by making the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Banzhaf power index can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated. The disciplined statement is: given the exact cooperative game theory and collective choice carrier, defining parameters and conventions, boundary conditions, source evidence, comparison cases, and any measurement or proof assumptions needed to evaluate Banzhaf power index, the structure counts as Banzhaf power index exactly when the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit.

This format also separates identity from measurement. Empirical, computational, or documentary proxies support recognition only under declared validity and uncertainty assumptions; formal cases require proof rather than measurement. Measurements can be noisy, implementations can approximate, and proofs can use equivalent characterizations; none of those facts licenses changing the object being measured. When reports disagree, first check scope and convention, then data or proof, and only then interpret the disagreement as substantive.

Manages Complexity

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Banzhaf power index. Banzhaf power index compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

The compression has a price. A single label can hide canonical, generalized, restricted, approximate, computational, empirical, and historically variant formulations of Banzhaf power index. Good use therefore carries a small declaration of assumptions alongside the name. The abstraction manages complexity when it reduces the state space of the question while keeping the failure boundary visible; it mismanages complexity when the label substitutes for that boundary analysis.

Abstract Reasoning

  1. Identify the carrier. State what the elements, states, objects, or observations are: the typed cooperative game theory and collective choice carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
  2. Lock the constitutive rule. Express the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit independently of one notation or implementation. This step prevents the canonical example from becoming the definition.
  3. Derive consequences. From the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit, infer recognizing and comparing instances of Banzhaf power index, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions. Record each assumption used so that a later change of setting does not silently preserve an invalid conclusion.
  4. Test adversarial cases. Examine a generalized or degenerate case may change existence, uniqueness, measurement, or naming conventions, so the exact definition of Banzhaf power index must control the decision and an object that resembles Banzhaf power index in purpose or vocabulary but does not satisfy its invariant is outside the class. A robust identity explains why the first is convention-sensitive and why the second is outside the class.
  5. Compare and refine. Use carrier, parameters, convention, domain, scale, boundary conditions, evidence, exact versus approximate form, and limiting behavior to compare legitimate instances, and refine the model when discrepancies reflect hidden variation rather than failure of the abstraction itself.

Knowledge Transfer

Knowledge transfers strongly among subfields of cooperative game theory and collective choice because they reuse the typed cooperative game theory and collective choice carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, All coalitions or vote profiles are enumerated under a declared probability model; removing or flipping one voter tests whether the outcome changes, and critical occurrences are counted and normalized., and type the carrier, state every parameter and convention in the definition, test that the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases. A theorem, diagnostic, or modeling warning can travel when those roles remain literal. For example, the distinction between constitutive identity and a convenient observable transfers from A canonical instance directly demonstrates that the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..[2]

Transfer outside the home domain is weaker. The skeletal pattern—type the carrier, apply the defining mechanism of Banzhaf power index, preserve its invariant, and derive only consequences licensed by the stated boundary—may suggest an analogy, but the domain-specific mechanisms, admissible evidence, and consequences do not come along automatically. The safe transfer procedure maps each role explicitly, checks the invariant again, and refuses the name when only a superficial resemblance remains.

Examples

Canonical

A canonical instance directly demonstrates that the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit. The example exposes the carrier and directly tests that the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit; changing incidental notation preserves the identity, while removing that condition destroys it. This example is canonical because every role can be inspected: the carrier is the typed cooperative game theory and collective choice carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets; the operative rule is All coalitions or vote profiles are enumerated under a declared probability model; removing or flipping one voter tests whether the outcome changes, and critical occurrences are counted and normalized.; the invariant is the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit; and the result supports recognizing and comparing instances of Banzhaf power index, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions.[3] Changing incidental notation or scale leaves the structure intact, while removing the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit destroys the classification.

Mapped back: the typed cooperative game theory and collective choice carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets → All coalitions or vote profiles are enumerated under a declared probability model; removing or flipping one voter tests whether the outcome changes, and critical occurrences are counted and normalized. → the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit → recognizing and comparing instances of Banzhaf power index, deriving its domain-specific consequences, selecting valid models or methods, and preventing transfer beyond its assumptions

Applied / In Practice

An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation. The applied case qualifies only because the same invariant and boundary test remain literal under changed parameters or implementation. The applied case is not licensed merely by vocabulary. It qualifies because the same recognition test—type the carrier, state every parameter and convention in the definition, test that the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases—can be run and because the same failure boundary—the carrier is mistyped, the condition that the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation are explicit fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test—remains meaningful.[1] The case also shows why practical outputs should report assumptions, resolution, and uncertainty instead of a naked label.

Mapped back: declared instance → recognition test → boundary check → qualified use

Structural Tensions

  • T1: Axiomatic identity vs. operational recognition. The defining conditions may be exact while empirical or computational recognition is approximate. Neither pole can be removed without changing the analytical task. Diagnostic: Can the reviewer state both the exact condition and the evidence used to infer it?
  • T2: Local roles vs. global consequence. The mechanism is enacted through local relations, but the abstraction is usually valued for a global classification or prediction. Neither pole can be removed without changing the analytical task. Diagnostic: Does the claimed global result actually follow from the declared local conditions?
  • T3: Ideal form vs. finite representation. Theory states a clean invariant while data structures, measurements, or proofs expose only finite representations. Neither pole can be removed without changing the analytical task. Diagnostic: Would increasing resolution converge toward the same classification?
  • T4: Canonical convention vs. legitimate variants. A standard formulation supports communication, while variants may preserve the same core under changed assumptions. Neither pole can be removed without changing the analytical task. Diagnostic: Which role is invariant across variants, and which convention-specific conclusion changes?
  • T5: Compression vs. hidden assumptions. The name compresses a complex argument but can conceal prerequisites. Neither pole can be removed without changing the analytical task. Diagnostic: Can each downstream inference be traced to an explicit assumption?
  • T6: Autonomous residual vs. reduction to catalog neighbors. The candidate uses broader structures but adds an identity-bearing residual. Neither pole can be removed without changing the analytical task. Diagnostic: After subtracting the proposed parent and named neighbors, does the constitutive residual still support independent diagnostics?

Structural–Framed Character

The entry is structurally mixed but domain-framed. Its portable skeleton is type the carrier, apply the defining mechanism of Banzhaf power index, preserve its invariant, and derive only consequences licensed by the stated boundary. Its identity-bearing terms—Banzhaf power index, carrier, parameter, invariant, boundary, evidence, model, transformation, and application—derive their meaning from cooperative game theory and collective choice and cannot be replaced by generic systems language without losing the tests that distinguish valid from invalid instances.

This mixed character explains why the abstraction is reusable inside the domain yet does not meet the Prime bar. The structure organizes reasoning, but its claims still depend on domain-specific objects, evidence, and intervention semantics.

Structural Core vs. Domain Accent

The structural core consists of a carrier, All coalitions or vote profiles are enumerated under a declared probability model; removing or flipping one voter tests whether the outcome changes, and critical occurrences are counted and normalized., a recognition invariant, and a consequence. That skeleton may resemble patterns elsewhere, especially type the carrier, apply the defining mechanism of Banzhaf power index, preserve its invariant, and derive only consequences licensed by the stated boundary. The domain accent is not decorative: Banzhaf power index, carrier, parameter, invariant, boundary, evidence, model, transformation, and application determine what counts as an admissible carrier, a valid transition, and successful evidence.

The abstraction therefore remains domain-specific. A cross-domain reuse that preserves only words such as 'balance,' 'cut,' 'sequence,' 'loss,' or 'simulation' is metaphor. Literal transfer requires the original role structure and diagnostics, which in this case remain anchored in cooperative game theory and collective choice.

This entry is a kind of Counterfactual Reasoning.

It remains its own entry because its identity is fixed by the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation.

Relationships to Other Abstractions

Local relationship map for Banzhaf power indexParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Banzhaf power indexDOMAINPrime abstraction: Counterfactual Reasoning — is a kind ofCounterfactualReasoningPRIME

Current abstraction Banzhaf power index Domain-specific

Parents (1) — outgoing typed relations

  • Banzhaf power index is a kind of Counterfactual Reasoning Prime

    It remains its own entry because its identity is fixed by the players and voting weights, quota and winning rule, coalition or binary-profile sample space, critical-voter definition, probability assumptions, absolute or normalized formula, null players, computational method, and interpretation.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Banzhaf power index sits in a crowded region of the domain-specific corpus (25th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Cooperative Game Theory & Power Indices (12 abstractions)

Nearest neighbors

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

Not to Be Confused With

  • Shapley-Shubik power index. Shapley-Shubik measures pivotality across all voter orderings; Banzhaf measures swings across coalitions or equiprobable vote profiles.
  • One canonical example. An instance demonstrates the structure but does not define the whole abstraction.
  • Measurement or implementation of Banzhaf power index. A proxy or realization is evidence for the abstraction, not the abstraction itself.
  • Generalized Banzhaf power index. An extension qualifies only when its changed axioms and retained invariant are stated.

References

[1] James S Coleman, 'Social Choice', Gordon and Breach, 1971. registry ↩a ↩b

[2] Dan S Felsenthal, Moshé Machover, 'The Measurement of Voting Power Theory and Practice, Problems and Paradoxes', Edward Elgar, 1998.not authoritative registry ↩

[3] John F Banzhaf, 'Weighted Voting Doesn't Work: A Mathematical Analysis', Rutgers Law Review, 1965. withdrawn registry ↩a ↩b