Distributed Monitoring of Election Winners

05/06/2018
by   Arnold Filtser, et al.
0

We consider distributed elections, where there is a center and k sites. In such distributed elections, each voter has preferences over some set of candidates, and each voter is assigned to exactly one site such that each site is aware only of the voters assigned to it. The center is able to directly communicate with all sites. We are interested in designing communication-efficient protocols, allowing the center to maintain a candidate which, with arbitrary high probability, is guaranteed to be a winner, or at least close to being a winner. We consider various single-winner voting rules, such as variants of Approval voting and scoring rules, tournament-based voting rules, and several round-based voting rules. For the voting rules we consider, we show that, using communication which is logarithmic in the number of voters, it is possible for the center to maintain such approximate winners; that is, upon a query at any time the center can immediately return a candidate which is guaranteed to be an approximate winner with high probability. We complement our protocols with lower bounds. Our results have implications in various scenarios, such as aggregating customer preferences in online shopping websites or supermarket chains and collecting votes from different polling stations of political elections.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/25/2018

The Complexity of the Possible Winner Problem over Partitioned Preferences

The Possible-Winner problem asks, given an election where the voters' pr...
research
07/03/2020

Approval-Based Committee Voting: Axioms, Algorithms, and Applications

Approval-based committee (ABC) rules are voting rules that output a fixe...
research
02/15/2021

Selecting Matchings via Multiwinner Voting: How Structure Defeats a Large Candidate Space

Given a set of agents with approval preferences over each other, we stud...
research
05/13/2019

Lie on the Fly: Strategic Voting in an Iterative Preference Elicitation Process

A voting center is in charge of collecting and aggregating voter prefere...
research
06/22/2021

Measuring Violations of Positive Involvement in Voting

In the context of computational social choice, we study voting methods t...
research
08/19/2015

Fishing out Winners from Vote Streams

We investigate the problem of winner determination from computational so...
research
09/05/2023

Aggregating Correlated Estimations with (Almost) no Training

Many decision problems cannot be solved exactly and use several estimati...

Please sign up or login with your details

Forgot password? Click here to reset