Advanced Search
MyIDEAS: Login

Scoring Rules on Dichotomous Preferences

Contents:

Author Info

Abstract

In this paper, we study individual incentives to report preferences truthfully for the special case when individuals have dichotomous preferences on the set of alternatives and preferences are aggregated in form of scoring rules. In particular, we show that (a) the Borda Count coincides with Approval Voting on the dichotomous preference domain, (b) the Borda Count is the only strategy-proof scoring rule on the dichotomous preference domain, and (c) if at least three individuals participate in the election, then the dichotomous preference domain is the unique maximal rich domain under which the Borda Count is strategy-proof.

Download Info

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.
File URL: http://pareto.uab.es/wp/2004/61704.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC) in its series UFAE and IAE Working Papers with number 617.04.

as in new window
Length: 23
Date of creation: 09 Aug 2004
Date of revision:
Handle: RePEc:aub:autbar:617.04

Contact details of provider:
Postal: 08193, Bellaterra, Barcelona
Phone: 34 93 592 1203
Fax: +34 93 542-1223
Email:
Web page: http://pareto.uab.cat
More information through EDIRC

Related research

Keywords: Approval Voting; Borda Count; Dichotomous Preferences; Social Choice Function;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
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.:
as in new window
  1. Berga, Dolors & Serizawa, Shigehiro, 2000. "Maximal Domain for Strategy-Proof Rules with One Public Good," Journal of Economic Theory, Elsevier, vol. 90(1), pages 39-61, January.
  2. Martin Barbie & Clemens Puppe & Attila Tasnadi, 2003. "Non-Manipulable Domains for the Borda Count," Bonn Econ Discussion Papers bgse13_2003, University of Bonn, Germany.
  3. Bogomolnaia, Anna & Moulin, Herve & Stong, Richard, 2003. "Collective Choice under Dichotomous Preferences," Working Papers 2003-09, Rice University, Department of Economics.
  4. Michael Dummett, 1998. "The Borda count and agenda manipulation," Social Choice and Welfare, Springer, vol. 15(2), pages 289-296.
  5. Barbera, Salvador & Sonnenschein, Hugo & Zhou, Lin, 1991. "Voting by Committees," Econometrica, Econometric Society, vol. 59(3), pages 595-609, May.
  6. David A. Smith, 1999. "Manipulability measures of common social choice functions," Social Choice and Welfare, Springer, vol. 16(4), pages 639-661.
  7. Ching, Stephen & Serizawa, Shigehiro, 1998. "A Maximal Domain for the Existence of Strategy-Proof Rules," Journal of Economic Theory, Elsevier, vol. 78(1), pages 157-166, January.
  8. Saari, Donald G, 1990. " Susceptibility to Manipulation," Public Choice, Springer, vol. 64(1), pages 21-41, January.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Marc Vorsatz, 2004. "Approval Voting ion Dichotomous Preferences," UFAE and IAE Working Papers 619.04, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
  2. Uuganbaatar Ninjbat, 2012. "Remarks on Young's theorem," Economics Bulletin, AccessEcon, vol. 32(1), pages 706-714.
  3. Kentaro Hatsumi & Dolors Berga & Shigehiro Serizawa, 2011. "A maximal domain for strategy-proof and no-vetoer rules in the multi-object choice model," ISER Discussion Paper 0809, Institute of Social and Economic Research, Osaka University, revised Feb 2013.
  4. Darmann, Andreas & Klamler, Christian & Pferschy, Ulrich, 2009. "Maximizing the minimum voter satisfaction on spanning trees," Mathematical Social Sciences, Elsevier, vol. 58(2), pages 238-250, September.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:aub:autbar:617.04. 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: (Xavier Vila).

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.