Template-Type: ReDIF-Paper 1.0
Title: Non-Manipulable Domains for the Borda Count
Author-Name: Martin Barbie
Author-Name: Clemens Puppe
Author-Name: Attila Tasnadi
Author-Email: 
Classification-JEL: D71
Keywords: Borda count, scoring methods, non-manipulability
Abstract: 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. 
Note: 
Length: 22
Creation-Date: 2003-07
Revision-Date: 
File-URL: http://www.wiwi.uni-bonn.de/bgsepapers/bonedp/bgse13_2003.pdf
File-Format: application/pdf
Handle: RePEc:bon:bonedp:bgse13_2003