# Proportional Representation in Vote Streams

arXiv: https://arxiv.org/abs/1702.08862 · HTML: https://mlsanity.com/paper/1702.08862/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 28 Feb 2017.

## Built on by (most cited first, 3 of 3)

- [Temporal Fairness in Multiwinner Voting](https://mlsanity.com/paper/2312.04417/) (2023)
- [Online Approval Committee Elections](https://mlsanity.com/paper/2202.06830/) (2022)
- [Efficient Social Choice via NLP and Sampling](https://mlsanity.com/paper/2309.12360/) (2023)

## Abstract (arXiv)

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-- ourant 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.