Manipulability in Restricted Separable Domains
AbstractWe study a problem where a group of voters must decide which candidates are elected from a set of alternatives. The voters’ preferences on the combinations of elected candidates are represented by orderings. We propose a family of restrictions of the domain of separable preferences. These subdomains are generated from a partition that identifies, for each voter, her friends, her enemies and the unbiased candidates. We characterize the family of rules that satisfy strategy-proofness and tops-onliness on each of those subdomains.
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 InfoPaper provided by Universidad de Málaga, Department of Economic Theory, Málaga Economic Theory Research Center in its series Working Papers with number 2011-01.
Length: 14 pages
Date of creation: Feb 2011
Date of revision:
Contact details of provider:
Postal: Plaza del Ejido s/n 29071, Málaga
Web page: http://webdeptos.uma.es/THEconomica/malagawpseries/METC.html
More information through EDIRC
separable preferences; aggregation; strategy-prooness; tops-onliness;
Find related papers by JEL classification:
- D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
- D70 - Microeconomics - - Analysis of Collective Decision-Making - - - General
You can help add them by filling out this form.
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: (Samuel Danthine).
If references are entirely missing, you can add them using this form.