Communication complexity of common voting rules


Journal Article

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. Copyright 2005 ACM.

Full Text

Duke Authors

Cited Authors

  • Conitzer, V; Sandholm, T

Published Date

  • December 1, 2005

Published In

  • Proceedings of the Acm Conference on Electronic Commerce

Start / End Page

  • 78 - 87

Digital Object Identifier (DOI)

  • 10.1145/1064009.1064018

Citation Source

  • Scopus