Proportional Representation in Vote Streams

02/28/2017
by   Palash Dey, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/11/2017

Monotonicity axioms in approval-based multi-winner voting rules

In this paper we study several monotonicity axioms in approval-based mul...
research
11/26/2016

Multiwinner Approval Rules as Apportionment Methods

We establish a link between multiwinner elections and apportionment prob...
research
01/29/2018

Representing the Insincere: Strategically Robust Proportional Representation

Proportional representation (PR) is a fundamental principle of many demo...
research
02/22/2020

A characterization of proportionally representative committees

A well-known axiom for proportional representation is Proportionality of...
research
08/25/2017

Achieving Proportional Representation via Voting

Proportional representation (PR) is often discussed in voting settings a...
research
11/22/2017

Proportionally Representative Participatory Budgeting: Axioms and Algorithms

Participatory budgeting is one of the exciting developments in deliberat...
research
04/23/2020

Non-Adaptive Adaptive Sampling on Turnstile Streams

Adaptive sampling is a useful algorithmic tool for data summarization pr...

Please sign up or login with your details

Forgot password? Click here to reset