EconStor >
Rheinische Friedrich-Wilhelms-Universität Bonn >
Bonn Graduate School of Economics (BGSE), Universität Bonn >
Bonn Econ Discussion Papers, Bonn Graduate School of Economics (BGSE), Universität Bonn >

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10419/22863
  
Title:Non-Manipulable Domains for the Borda Count PDF Logo
Authors:Barbie, Martin
Puppe, Clemens
Tasnádi, Attila
Issue Date:2003
Series/Report no.:Bonn econ discussion papers 2003,13
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 nonmanipulable for all possible tie-breaking rules are again the cyclic permutation domains.
JEL:D71
Document Type:Working Paper
Appears in Collections:Bonn Econ Discussion Papers, Bonn Graduate School of Economics (BGSE), Universität Bonn

Files in This Item:
File Description SizeFormat
bgse13_2003.pdf396.15 kBAdobe PDF
No. of Downloads: Counter Stats
Download bibliographical data as: BibTeX
Share on:http://hdl.handle.net/10419/22863

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.