On the informational efficiency of simple scoring rules
We study information aggregation in large elections. With two candidates, efficient information aggregation is possible (e.g., Feddersen and Pesendorfer ,  and ). We show that this result does not extend to elections with more than two candidates. We study a class of simple scoring rules in voting games with Poisson population uncertainty and three candidates. No simple scoring rule aggregates information efficiently, even if preferences are dichotomous and a Condorcet winner always exists. We introduce a weaker criterion of informational efficiency that requires a voting rule to have at least one efficient equilibrium. Only approval voting satisfies this criterion.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:146:y:2011:i:4:p:1464-1480. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.