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...

This paper presents a general procedure for finding profiles with the minimum number of voters required for many important paradoxes. Borda's and Condorcet's classic examples are revisited as well as generalizations. Using Saari's procedure line, we obtain an upper bound for the minimum number...

Using computer simulations based on three separate data generating processes, I estimate the fraction of elections in which sincere voting will be a core equilibrium given each of eight single-winner voting rules. Additionally, I determine how often each voting rule is vulnerable to simple...

In this paper we provide a two-stage group decision-making procedure for ranking a great number of alternatives. Since individuals usually have incon-sistencies in the pairwise comparison of alternatives, we allow agents to assess alternatives one by one using linguistic labels. This information...

In 2006, the Public Choice Society chose a new president using approval voting. There were five candidates, and the election was extremely close. We indicate the sources of support of the different candidates, based in part on spectral analysis, by voters who cast between one and five votes....

We discuss the relationships between positional rules (such as plurality and approval voting as well as the Borda count), Dodgson’s, Kemeny’s and Litvak’s methods of reaching consensus. The discrepancies between methods are seen as results of different intuitive conceptions...

In an election without a Condorcet winner, Dodgson's Method is designed to find the candidate that is "closest" to being a Condorcet winner. In this paper, we show that the winner from Dodgson's Method can occur at any position in the ranking obtained from the Borda Count, the plurality method,...

We characterize the preference domains on which the Borda count satisfies Maskin monotonicity. The basic concept is the notion of a "cyclic permutation domain" which arises by fixing one particular ordering of alternatives and including all its cyclic permutations. The cyclic permutation domains...

Does there exist a voting rule to be, for example, inserted into the constitution of a newly constructed apartment building, which is likely to attract the greatest number of consumers? We analyze this and other questions within a framework in which co-owners resolve future debates by voting. We...