Compilation and communication protocols for voting rules with a dynamic set of candidates

Authors:
Yann Chevaleyre;Jérôme Lang;Nicolas Maudet;Jérôme Monnot
Affiliations:
LIPN, Université Paris-Nord, Villetaneuse, France;LAMSADE, Université Paris-Dauphine, Paris Cedex, France;LAMSADE, Université Paris-Dauphine, Paris Cedex, France;LAMSADE, Université Paris-Dauphine, Paris Cedex, France
Venue:
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Year:
2011

Citing 6
Cited 0

Communication complexity

Communication complexity
Communication complexity of common voting rules

Proceedings of the 6th ACM conference on Electronic commerce
A note on the query complexity of the Condorcet winner problem

Information Processing Letters
Compiling the votes of a subelectorate

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules

Journal of Computer and System Sciences
Possible winners when new alternatives join: new results coming up!

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the problem of designing communication protocols for voting rules when the set of candidates can evolve via the addition of new candidates. We show that the necessary amount of communication that must be transmitted between the voters and the central authority depends on the amount of space devoted to the storage of the votes over the initial set of candidates. This calls for a bicriteria evaluation of protocols. We consider a few usual voting rules, and three types of storage functions: full storage, where the full votes on the initial set of voters are stored; null storage, where nothing is stored; and anonymous storage, which lies in-between. For some of these pairs (voting rule, type of storage) we design protocols and show that they are asymptotically optimal by determining the communication complexity of the rule under the storage function considered.