We study the performance of the Quadratic Voting (QV) mechanism proposed by Lalley and Weyl (2016) in finite populations of various sizes using three decreasingly analytic but increasingly precise methods with emphasis on examples calibrated to the 2008 gay marriage referendum in California....

Voters have strong incentives to increase their influence by trading votes, a practice indeed believed to be common. But is vote trading welfare-improving or welfare-decreasing? We review the theoretical literature and, when available, its related experimental tests. We begin with the analysis...

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...

Lalley and Weyl (2016) propose a mechanism for binary collective decisions, Quadratic Voting, and prove its approximate efficiency in large populations in a stylized environment. They motivate their proposal substantially based on its greater robustness when compared with pre-existing efficient...

How does group identity affect belief formation? To address this question, we conduct a series of online experiments with a representative sample of individuals in the US. Using the setting of the 2020 US presidential election, we find evidence of intergroup preference across three distinct...

How does group identity affect belief formation? To address this question, we conduct a series of online experiments with a representative sample of individuals in the US. Using the setting of the 2020 US presidential election, we find evidence of intergroup preference across three distinct...

A collective decision problem is described by a set of agents, a profile of single-peaked preferences over the real line and a number k of public facilities to be located. We consider public facilities that do not suffer from congestion and are non-excludable. We provide a characterization of...

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...

In a voting model where the set of feasible alternatives is a subset of a product set $A = A_1\times\cdots\ldots{}A_m$ of $m$ finite categories, we characterize the set of all strategy-proof social choice functions for three different types of preference domains over $A$, namely for the domains...