Proportional representation in vote streams

Palash Dey, Nimrod Talmon, Otniel Van Handel

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

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.

Original languageEnglish
Title of host publication16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017
EditorsEdmund Durfee, Sanmay Das, Kate Larson, Michael Winikoff
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Pages15-23
Number of pages9
ISBN (Electronic)9781510855076
StatePublished - 1 Jan 2017
Externally publishedYes
Event16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017 - Sao Paulo, Brazil
Duration: 8 May 201712 May 2017

Publication series

NameProceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Volume1
ISSN (Print)1548-8403
ISSN (Electronic)1558-2914

Conference

Conference16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017
Country/TerritoryBrazil
CitySao Paulo
Period8/05/1712/05/17

Keywords

  • Data streams
  • Proportional representation
  • Sublinear algorithms
  • Voting

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Control and Systems Engineering

Cite this