Name
Abstract | ||
|---|---|---|
We consider elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respect to common multiwinner proportional representation voting rules; specifically, we consider the Approval-based and the Borda-based variants of both the Chamberlin-Courant rule and the Monroe rule. We complement our algorithms with lower bounds. Somewhat surprisingly, our results imply that, using space which does not depend on the number of voters it is possible to efficiently identify an approximate representative committee of fixed size over vote streams with huge number of voters. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.5555/3091125.3091134 | AAMAS |
Keywords | DocType | Volume |
voting,data streams,sublinear algorithms,proportional representation | Conference | abs/1702.08862 |
Citations | PageRank | References |
2 | 0.37 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Palash Dey | 1 | 38 | 13.36 |
| Nimrod Talmon | 2 | 133 | 29.22 |
| Otniel van Handel | 3 | 2 | 0.37 |