In: Handbook of Game Theory with Economic Applications
Voting procedures focus on the aggregation of individuals' preferences to produce collective decisions. In practice, a voting procedure is characterized by ballot responses and the way ballots are tallied to determine winners. Voters are assumed to have clear preferences over candidates and attempt to maximize satisfaction with the election outcome by their ballot responses. Such responses can include strategic misrepresentation of preferences.Voting procedures are formalized by social choice functions, which map ballot response profiles into election outcomes. We discuss broad classes of social choice functions as well as special cases such as plurality rule, approval voting, and Borda's point-count method. The simplest class is voting procedures for two-candidate elections. Conditions for social choice functions are presented for simple majority rule, the class of weighted majority rules, and for what are referred to as hierarchical representative systems.The second main class, which predominates in the literature, embraces all procedures for electing one candidate from three or more contenders. The multicandidate elect-one social choice functions in this broad class are divided into nonranked one-stage procedures, nonranked multistage procedures, ranked voting methods, and positional scoring rules. Nonranked methods include plurality check-one voting and approval voting, where each voter casts either no vote or a full vote for each candidate. On ballots for positional scoring methods, voters rank candidates from most preferred to least preferred. Topics for multicandidate methods include axiomatic characterizations, susceptibility to strategic manipulation, and voting paradoxes that expose questionable aspects of particular procedures.Other social choice functions are designed to elect two or more candidates for committee memberships from a slate of contenders. Proportional representation methods, including systems that elect members sequentially from a single ra
(This abstract was borrowed from another version of this item.)
If 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
|This chapter was published in: ||This item is provided by Elsevier in its series Handbook of Game Theory with Economic Applications with number
2-30.||Handle:|| RePEc:eee:gamchp:2-30||Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/bookseriesdescription.cws_home/BS_HE/description|
When requesting a correction, please mention this item's handle: RePEc:eee:gamchp:2-30. See general 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: (Dana Niculescu)
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.