Towards secure quadratic voting
Author(s)Park, Sunoo; Rivest, Ronald L
MetadataShow full item record
We provide an overview of some of the security issues involved in securely implementing Lalley and Weyl’s “Quadratic Voting” (Lalley and Weyl, Quadratic voting, 2016), and suggest some possible implementation architectures. Our proposals blend end-to-end verifiable voting methods with anonymous payments. We also consider new refund rules for quadratic voting, such as a “lottery” method.
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Park, Sunoo and Rivest, Ronald L. “Towards Secure Quadratic Voting.” Public Choice 172, 1–2 (February 2017): 151–175 © 2017 Springer Science+Business Media New York
Author's final manuscript