Fishing out Winners from Vote Streams

by   Arnab Bhattacharyya, et al.

We investigate the problem of winner determination from computational social choice theory in the data stream model. Specifically, we consider the task of summarizing an arbitrarily ordered stream of n votes on m candidates into a small space data structure so as to be able to obtain the winner determined by popular voting rules. As we show, finding the exact winner requires storing essentially all the votes. So, we focus on the problem of finding an -winner, a candidate who could win by a change of at most fraction of the votes. We show non-trivial upper and lower bounds on the space complexity of -winner determination for several voting rules, including k-approval, k-veto, scoring rules, approval, maximin, Bucklin, Copeland, and plurality with run off.


page 1

page 2

page 3

page 4


Favorite-Candidate Voting for Eliminating the Least Popular Candidate in Metric Spaces

We study single-candidate voting embedded in a metric space, where both ...

Data Smashing

Investigation of the underlying physics or biology from empirical data r...

Breaking the Metric Voting Distortion Barrier

We consider the following well studied problem of metric distortion in s...

Frugal Bribery in Voting

Bribery in elections is an important problem in computational social cho...

Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability

We study winner determination for three prevalent k-committee selection ...

Improved lower bound on the dimension of the EU council's voting rules

Kurz and Napel (2015) proved that the voting system of the EU council (b...

Distributed Monitoring of Election Winners

We consider distributed elections, where there is a center and k sites. ...

Please sign up or login with your details

Forgot password? Click here to reset