@inproceedings{dbdc323cab1b45c6826e5ef1edc238c3,
title = "Proportional representation in vote streams",
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.",
keywords = "Data streams, Proportional representation, Sublinear algorithms, Voting",
author = "Palash Dey and Nimrod Talmon and {Van Handel}, Otniel",
note = "Publisher Copyright: {\textcopyright} Copyright 2017, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All Rights Reserved.; 16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017 ; Conference date: 08-05-2017 Through 12-05-2017",
year = "2017",
month = jan,
day = "1",
language = "English",
series = "Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS",
publisher = "International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)",
pages = "15--23",
editor = "Edmund Durfee and Sanmay Das and Kate Larson and Michael Winikoff",
booktitle = "16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017",
}