We characterize the preference domains on which the Borda count satisfies Arrow's ``independence of irrelevant alternatives" condition. Under a weak richness condition, these domains are obtained by fixing one preference ordering and including all its cyclic permutations (``Condorcet cycles"). We then ask on which domains the Borda count is non-manipulable. It turns out that it is non-manipulable on a broader class of domains when combined with appropriately chosen tie-breaking rules. On the other hand, we also prove that the rich domains on which the Borda count is non-manipulable for all possible tie-breaking rules are again the cyclic permutation domains.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Publisher Info
Paper provided by University of Bonn, Germany in its series Bonn Econ Discussion Papers with number
bgse13_2003.
Length: 22 Date of creation: Jul 2003 Date of revision: Handle: RePEc:bon:bonedp:bgse13_2003
Contact details of provider: Postal: Bonn Graduate School of Economics, University of Bonn, Adenauerallee 24 - 26, 53113 Bonn, Germany Fax: +49 228 73 9221 Web page: http://www.bgse.uni-bonn.de/index.php?id=494
For technical questions regarding this item, or to correct its listing, contact: (Daniel Park).
Cited by: (explanations, 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.)