Proportional Representation in Vote Streams

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.

[1]  Burt L. Monroe,et al.  Fully Proportional Representation , 1995, American Political Science Review.

[2]  Rajeev Motwani,et al.  Sampling from a moving window over streaming data , 2002, SODA '02.

[3]  Vincent Conitzer,et al.  Compilation Complexity of Common Voting Rules , 2010, AAAI.

[4]  Ariel D. Procaccia,et al.  On the complexity of achieving proportional representation , 2008, Soc. Choice Welf..

[5]  John R. Chamberlin,et al.  Representative Deliberations and Representative Decisions: Proportional Representation and the Borda Rule , 1983, American Political Science Review.

[6]  Arnab Bhattacharyya,et al.  Sample Complexity for Winner Prediction in Elections , 2015, AAMAS.

[7]  Arnab Bhattacharyya,et al.  Fishing out Winners from Vote Streams , 2015, Electron. Colloquium Comput. Complex..

[8]  Piotr Faliszewski,et al.  Fully Proportional Representation with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time , 2015, AAAI.

[9]  Piotr Faliszewski,et al.  Achieving fully proportional representation by clustering voters , 2016, AAMAS.

[10]  Jstor.  The American political science review , 2022 .

[11]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[12]  Yann Chevaleyre,et al.  Compilation and communication protocols for voting rules with a dynamic set of candidates , 2011, TARK XIII.

[13]  Nadja Betzler,et al.  On the Computation of Fully Proportional Representation , 2011, J. Artif. Intell. Res..

[14]  Craig Boutilier,et al.  Social Choice : From Consensus to Personalized Decision Making , 2011 .

[15]  Andrew McGregor,et al.  Better Streaming Algorithms for the Maximum Coverage Problem , 2018, Theory of Computing Systems.

[16]  Vincent Conitzer,et al.  Communication complexity of common voting rules , 2005, EC '05.

[17]  Piotr Faliszewski,et al.  Properties of multiwinner voting rules , 2014, Social Choice and Welfare.

[18]  Piotr Faliszewski,et al.  Finding a collective set of items: From proportional multirepresentation to group recommendation , 2014, Artif. Intell..

[19]  Nimrod Talmon,et al.  Distributed Monitoring of Election Winners , 2017, AAMAS.

[20]  David P. Woodruff,et al.  An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems , 2016, PODS.

[21]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[22]  Vincent Conitzer,et al.  Vote elicitation: complexity and strategy-proofness , 2002, AAAI/IAAI.

[23]  Piotr Faliszewski,et al.  Fully Proportional Representation as Resource Allocation: Approximability Results , 2012, IJCAI.

[24]  Yann Chevaleyre,et al.  Compiling the votes of a subelectorate , 2009, IJCAI 2009.