Quadratic Voting — Gold Standard Technical Record
Quadratic Voting (QV) enables nuanced preference expression under a budget by charging convex costs for votes; each voter's influence on an option is the total votes allocated to that option, with costs rising quadratically.
Quadratic Voting (QV) is a voting mechanism designed to mitigate the "tyranny of the majority" and allow for more nuanced expression of preferences, particularly in collective decision-making and funding scenarios. Unlike standard majority voting where each person gets one vote, or plurality voting where the option with the most votes wins, QV uses a quadratic cost function for allocating votes. In essence, a voter can express the intensity of their preference by spending a budget of "voice credits." The cost to cast n votes for a particular option is n^2 credits. This means that expressing a strong preference (casting many votes) becomes exponentially more expensive than expressing a weak preference. The total number of votes cast for an option determines its success, but the cost structure ensures that a large number of individuals with moderate preferences can outweigh a smaller group with very strong, but concentrated, preferences. This mechanism is often paired with a "Catalyst" or matching fund, where public funds are distributed proportionally to the total quadratic votes received by projects, further amplifying the impact of collective preference. QV is implemented in various decentralized governance systems and funding platforms. Trade-offs include the complexity of implementation, the need for a defined budget or credit system for voters, and potential strategic voting behaviors, although it's generally considered more resistant to manipulation than simple majority voting.
graph LR
Center["Quadratic Voting — Gold Standard Technical Record"]:::main
Pre_mathematics["mathematics"]:::pre --> Center
click Pre_mathematics "/terms/mathematics"
Rel_advanced_propulsion_systems["advanced-propulsion-systems"]:::related -.-> Center
click Rel_advanced_propulsion_systems "/terms/advanced-propulsion-systems"
Rel_governance_token["governance-token"]:::related -.-> Center
click Rel_governance_token "/terms/governance-token"
classDef main fill:#7c3aed,stroke:#8b5cf6,stroke-width:2px,color:white,font-weight:bold,rx:5,ry:5;
classDef pre fill:#0f172a,stroke:#3b82f6,color:#94a3b8,rx:5,ry:5;
classDef child fill:#0f172a,stroke:#10b981,color:#94a3b8,rx:5,ry:5;
classDef related fill:#0f172a,stroke:#8b5cf6,stroke-dasharray: 5 5,color:#94a3b8,rx:5,ry:5;
linkStyle default stroke:#4b5563,stroke-width:2px;
🧒 Простыми словами
Imagine you have 10 "like" points to give. Instead of giving 10 points to one thing, QV makes it cost 1 point for 1 like, 4 points for 2 likes, and 9 points for 3 likes. This makes you really think about what you like the most!
🤓 Expert Deep Dive
Quadratic Voting's core innovation lies in its cost function, C(n) = n^2, where C is the cost in credits and n is the number of votes. This function ensures that the marginal cost of each additional vote increases, discouraging vote aggregation by single actors and promoting broader consensus. The total number of votes for an option i is V_i = Σ n_ij, where n_ij is the number of votes cast by voter j for option i. The total cost incurred by voter j is Σ C(n_ij) <= Budget_j. In matching fund scenarios, the total payout to project i is often Payout_i = Base + Matching_Factor * V_i, where Base is a baseline allocation and Matching_Factor scales with the total votes. This mechanism aims to approximate the social welfare optimum under certain assumptions about utility functions. Edge cases include voters with zero budget or strategic voters attempting to game the system (though QV is more robust than linear voting). Vulnerabilities might arise from Sybil attacks if identity verification is weak, or from poorly calibrated budget/cost parameters. The primary architectural trade-off is between computational complexity/implementation difficulty and the fidelity of preference aggregation.