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 [5-7]). 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. (C) 2011 Elsevier Inc. All rights reserved.