Barbie, Martin; Puppe, Clemens; Tasnádi, Attila - 2003
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")....