Communication complexity
Preprocessing of intractable problems
Information and Computation
Vote elicitation: complexity and strategy-proofness
Eighteenth national conference on Artificial intelligence
Communication complexity of common voting rules
Proceedings of the 6th ACM conference on Electronic commerce
Complexity of terminating preference elicitation
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Determining possible and necessary winners under common voting rules given partial orders
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
Incompleteness and incomparability in preference aggregation
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Finite local consistency characterizes generalized scoring rules
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Comparing multiagent systems research in combinatorial auctions and voting
Annals of Mathematics and Artificial Intelligence
Compilation and communication protocols for voting rules with a dynamic set of candidates
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
On the evaluation of election outcomes under uncertainty
Artificial Intelligence
Voter response to iterated poll information
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Generalized scoring rules: a framework that reconciles Borda and Condorcet
ACM SIGecom Exchanges
| Hi-index | 0.00 |
In many practical contexts where a number of agents have to find a common decision, the votes do not come all together at the same time. In such situations, we may want to preprocess the information given by the subelectorate (consisting of the voters who have expressed their votes) so as to "compile" the known votes for the time when the latecomers have expressed their votes. We study the amount of space necessary for such a compilation, as a function of the voting rule, the number of candidates, and the number of votes already known. We relate our results to existing work, especially on communication complexity.