Compiling the Votes of a Subelectorate
AbstractIn many practical contexts where a number of agents have to ﬁnd 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Paris Dauphine University in its series Economics Papers from University Paris Dauphine with number 123456789/3900.
Date of creation: Dec 2009
Date of revision:
Find related papers by JEL classification:
- C60 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - General
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Chevaleyre, Yann & Lang, Jérôme & Maudet, Nicolas & Monnot, Jérôme & Xia, Lirong, 2012. "New candidates welcome! Possible winners with respect to the addition of new candidates," Mathematical Social Sciences, Elsevier, Elsevier, vol. 64(1), pages 74-88.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Alexandre Faure).
If references are entirely missing, you can add them using this form.