Compiling the Votes of a Subelectorate
| 
92 | 
41 | 
0
Abstract
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 situ-ations, 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 func-tion of the voting rule, the number of candidates,and the number of votes already known. We relate our results to existing work, especially on commu-nication complexity
还没有评论，说两句吧！
热门资源
The Variational S...
Unlike traditional images which do not offer in...
Learning to Predi...
Much of model-based reinforcement learning invo...
Stratified Strate...
In this paper we introduce Stratified Strategy ...
A Mathematical Mo...
Direct democracy, where each voter casts one vo...
Rating-Boosted La...
The performance of a recommendation system reli...
智能在线
400-630-6780
聆听.建议反馈
E-mail: support@tusaishared.com
资源分类
