Optimal Voting Rules
AbstractModern social choice theory, following Kenneth Arrow, treats voting as a method for aggregating diverse preferences and values. An earlier view, initiated by Marquis de Condorcet, is that voting is a method for aggregating information. Voters' opinions differ because they make errors of judgment; absent these errors they would all agree on the best choice. The goal is to design a voting rule that identifies the best choice with highest probability. This paper examines maximum likelihood estimation. Surprisingly, the optimal rule can also be axiomatized by variations of Arrow's axioms.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by American Economic Association in its journal Journal of Economic Perspectives.
Volume (Year): 9 (1995)
Issue (Month): 1 (Winter)
Find related papers by JEL classification:
- D72 - Microeconomics - - Analysis of Collective Decision-Making - - - Political Processes: Rent-seeking, Lobbying, Elections, Legislatures, and Voting Behavior
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Young, H. P., 1974. "An axiomatization of Borda's rule," Journal of Economic Theory, Elsevier, vol. 9(1), pages 43-52, September.
- Satterthwaite, Mark Allen, 1975. "Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions," Journal of Economic Theory, Elsevier, vol. 10(2), pages 187-217, April.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Jane Voros) or (Michael P. Albert).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.