Quadratic Voting

The defining mathematical rule of QV: the total cost to cast n votes on a single issue is the square of the number of votes purchased (n²). This means 1 vote costs 1 credit, 2 votes cost 4 credits, 3 votes cost 9 credits, and so on. This non-linear pricing forces participants to economize, allocating more votes only to issues they feel most passionately about, thereby revealing the intensity of preference, not just the direction.

QV's mathematical properties depend on one-person-one-credit allocation. Without robust identity verification, an attacker could create multiple pseudonymous identities (a Sybil attack) to buy votes cheaply at the linear start of the cost curve, circumventing the quadratic penalty. Effective implementations require a strong Sybil resistance mechanism, often using Soulbound Tokens, Verifiable Credentials, or biometric proof-of-personhood protocols to ensure each human receives an equal, non-transferable pool of voice credits.

Under standard economic assumptions, QV is a theoretically optimal mechanism for public goods funding. A rational voter will allocate credits such that their marginal vote cost equals the marginal benefit they derive from the decision. This results in the collective outcome approximating the one that maximizes aggregate utility. In practice, this is used in Quadratic Funding for open-source software, where a matching pool amplifies the number of individual contributors, not just the total sum donated.

A primary vulnerability of QV is collusion, where a coordinated group of voters pools their credits to act as a single, outsized influence. This breaks the assumption of independent decision-making. Mitigation strategies include pairwise coordination subsidies or algorithmic detection of coordinated voting patterns. The mechanism is also susceptible to the tyranny of the majority if a large, apathetic group votes uniformly against a small, intense minority on a low-stakes issue for them.

QV can be combined with Liquid Democracy to reduce voter fatigue. Participants can delegate their voice credits to a trusted expert or representative on specific topics while retaining the right to override that delegation and vote directly. This creates a dynamic, issue-based representation system. The delegated credits are still subject to the quadratic cost rule when the delegate casts them, preserving the intensity-weighting property of the mechanism.

QV has moved beyond theory into practical governance. The Colorado Democratic Party used it in 2019 to prioritize platform planks. Gitcoin uses Quadratic Funding to allocate millions in matching funds to Ethereum ecosystem public goods. The city of Nashville, TN, has experimented with QV for participatory budgeting. These trials demonstrate its viability for aggregating community sentiment, though user education on the non-linear cost curve remains a critical adoption challenge.

The core problem Quadratic Voting solves: traditional one-person-one-vote systems capture direction of preference but not intensity. A minority with deep passion loses to an apathetic majority. QV allows participants to express how strongly they feel by allocating more votes to critical issues, but at a quadratic cost—buying n votes costs n² credits. This forces participants to economize, revealing their true cardinal preferences rather than just ordinal rankings. The mechanism translates subjective intensity into an objective, measurable signal for algorithmic reputation systems.

DAOs use QV to govern protocol upgrades, treasury allocations, and parameter changes. Unlike token-weighted voting where whales dominate, QV-based DAO governance:

• Empowers minority stakeholders with intense preferences
• Reduces plutocratic capture by making vote-buying exponentially expensive
• Surfaces latent consensus on contentious proposals Platforms like Snapshot and Democracy Earth integrate QV modules. The resulting vote distributions serve as high-fidelity reputation signals, indicating which proposals have genuine, broad-based support versus narrow, capital-driven backing.

QV belongs to the family of VCG mechanisms in mechanism design theory—a branch of game theory that engineers rules so rational self-interest leads to socially optimal outcomes. Key parallels:

• Vickrey Auction: Bidders pay the second-highest price, incentivizing truthful bidding
• Clarke-Groves Tax: Participants pay the externality their choice imposes on others QV extends this logic to collective choice by making the marginal cost of influence equal to the marginal externality imposed on other voters. Understanding this theoretical lineage is essential for engineers designing algorithmic reputation systems that must be strategy-proof and incentive-compatible.