Communication complexity of common voting rules

We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, single transferable vote (STV), Condorcet, approval, Bucklin, cup, maximin, Borda, Copeland, and ranked pairs. For each rule, we first give a deterministic communication protocol and an upper bound on the number of bits communicated in it; then, we give a lower bound on (even the nondeterministic) communication requirements of the voting rule. The bounds match for all voting rules except STV and maximin. Categories and Subject Descriptors F.2 [Theory of Computation]: Analysis of Algorithms and Problem Complexity; J.4 [Computer Applications]: Social and Behavioral Sciences—Economics General Terms Algorithms, Economics, Theory Keywords Communication Complexity, Voting

• Type: Conference
• Year: 2005
• Where: SIGECOM
• Authors: Vincent Conitzer, Tuomas Sandholm
• Keywords: Common Voting Rules, Communication Complexity, SIGECOM 2005, Voting Rules