Distributed monitoring of election winners

DOI10.1016/J.ARTINT.2019.07.007zbMATH Open1484.91161arXiv1805.02206OpenAlexW2965040163WikidataQ127408325 ScholiaQ127408325MaRDI QIDQ2289007FDOQ2289007

Authors: Arnold Filtser, Nimrod Talmon 

Publication date: 20 January 2020

Published in: Artificial Intelligence (Search for Journal in Brave)

Abstract: 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 arbitrarily 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 are theoretical in nature and relate to various scenarios, such as aggregating customer preferences in online shopping websites or supermarket chains and collecting votes from different polling stations of political elections.

Full work available at URL: https://arxiv.org/abs/1805.02206

Recommendations

• A distributed voting scheme to maximize preferences
• The distortion of distributed voting
• The distortion of distributed voting
• On the evaluation of election outcomes under uncertainty
• The communication burden of single transferable vote, in practice

zbMATH Keywords

communication complexitysublinear algorithmsdistributed streams

Mathematics Subject Classification ID

Voting theory (91B12)

Cites Work

• Optimal Random Sampling from Distributed Streams Revisited
• Continuous sampling from distributed streams
• Communication Complexity
• Determining possible and necessary winners given partial orders
• Swap bribery
• Control and Bribery in Voting
• Incompleteness and incomparability in preference aggregation: complexity results
• Algorithms for distributed functional monitoring
• Optimal tracking of distributed heavy hitters and quantiles
• Communication Complexity
• Functional Monitoring without Monotonicity
• Distributed monitoring of election winners
• Optimizing positional scoring rules for rank aggregation

Cited In (2)

• Robustness among multiwinner voting rules
• Distributed monitoring of election winners

This page was built for publication: Distributed monitoring of election winners

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289007)