Can mechanism design save democracy? We propose a simple design that offers a chance: individuals pay for as many votes as they wish using a number of "voice credits" quadratic in the votes they buy. Only quadratic cost induces marginal costs linear in votes purchased and thus welfare optimality...

This online appendix proves the central result in Lalley and Weyl (Forthcoming). The full text PDF for "Qaudratic Voting: How Mechanism Design Can Radicalize Democracy" may be found here: http://ssrn.com/abstract=2003531

The paper considers a voting model where each voter's type is her preference. The type graph for a voter is a graph whose vertices are the possible types of the voter. Two vertices are connected by an edge in the graph if the associated types are "neighbors." A social choice function is locally...

We investigate whether the simple plurality rule aggregates information efficiently in a large election with three alternatives. The environment is the same as in the Condorcet Jury Theorem (Condorcet (1785)). Voters have common preferences that depend on the unknown state of nature, and they...

This paper experimentally analyzes the effects if signatories to an international environmental agreement (IEA) apply different voting schemes to determine the terms of the agreement. To this end, unanimity, qualified majority voting, and simple majority voting are compared with respect to the...

When a group of voters selects a committee out of a set of candidates, it is common and often desirable to endow these voters with some veto power. I present impossibility results showing that even limited veto power makes many mechanisms of interest manipulable. This applies in particular (i)...

This chapter surveys voting game experiments that involve incomplete information with regard to voters’ opinions about what the best course of action might be and characteristics, especially their private costs and benefits related to decision making and their group affiliations (i.e., which...

A group of N individuals must choose between two collective alternatives. Under Quadratic Voting (QV), agents buy votes in favor of their preferred alternative from a clearing house, paying the square of the number of votes purchased; the sum of all votes purchased determines the outcome. We...

This paper considers the problem of allocating an amount of a perfectly divisible resource among agents. We are interested in rules eliminating the possibility that an agent can compensate another to misrepresent her preferences, making both agents strictly better off. Such rules are said to be...

This paper analyzes strategy-proof collective choice rules when individuals have single-crossing preferences on a finite and ordered set of social alternatives. It shows that a social choice rule is anonymous, unanimous, and strategy-proof on a maximal single-crossing domain if and only if it is...