quadratic_voting.md 2.3 KB
Quadratic voting
Quadratic voting (QV) is a decision-making mechanism that allows voters to pay money or other credits to express their priorities. The more credits a voter applies to a given option, the less each credit counts, according to a quadratic decay function.
The QV proposals involve several mechanisms to adjust for the power of wealth concentrations, such as distributing credits equally or redistributing the proceeds of credit contributions for future ballots.
Input: ballot of options, weight (e.g., money or pre-assigned credits)
Output: weighted outcome
Background
Quadratic voting was first proposed by Steven Lalley and E. Glen Weyl in 2012 and has been developed in several publications since. It has been widely discussed especially among people involved in blockchain protocol design. The concept is patented by Weyl and collaborators through the company Collective Decision Engines.
Feedback loops
Sensitivities
- Reflecting degrees of preference
- Dampening influence of excessive wealth
Oversights
- Deliberation processes
- Preferences of less credit-endowed participants, under certain implementations
Implementations
Communities
- Colorado state legislature used it to determine priorities
- Press: Wired, Colorado Sun
Tools
- Democracy Earth has implemented a quadratic voting tool
Further resources
- Lalley, Steven and Weyl, Eric Glen. "Quadratic Voting: How Mechanism Design Can Radicalize Democracy." American Economic Association Papers and Proceedings 1, no. 1 (2018)
- Posner, Eric A. and E. Glen Weyl. Radical Markets: Uprooting Capitalism and Democracy for a Just Society. Princeton University Press, 2018.
- Weyl, E. Glen. "The robustness of quadratic voting." Public Choice 172, no. 1-2 (July 2017)
- Weyl, W. Glen et al. "System and Method for Quadratic, Near-Quadratic, and Convex Voting in Various Types of Research and Voting." US patent US2016292947. October 6, 2016.