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
  

Full metadata record

DC FieldValueLanguage
dc.contributor.authorBarbie, Martinen_US
dc.contributor.authorPuppe, Clemensen_US
dc.contributor.authorTasnádi, Attilaen_US
dc.date.accessioned2009-01-29T15:10:29Z-
dc.date.available2009-01-29T15:10:29Z-
dc.date.issued2003en_US
dc.identifier.urihttp://hdl.handle.net/10419/22863-
dc.description.abstractWe 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.en_US
dc.language.isoengen_US
dc.publisheren_US
dc.relation.ispartofseriesBonn econ discussion papers 2003,13en_US
dc.subject.jelD71en_US
dc.subject.ddc330en_US
dc.subject.stwUnmöglichkeitstheoremen_US
dc.subject.stwTheorieen_US
dc.titleNon-Manipulable Domains for the Borda Counten_US
dc.typeWorking Paperen_US
dc.identifier.ppn382890000en_US
dc.rightshttp://www.econstor.eu/dspace/Nutzungsbedingungen-
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
Show simple item record
Download bibliographical data as: BibTeX

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