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 each of the sites. We are interested in designing communication-efficient protocols, allowing the center to maintain (i.e., declare) 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 these voting rules, we show that, using communication which is logarithmic in the number of voters, it is possible for the center to maintain such approximate winners. 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.
|Title of host publication||16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017|
|Editors||Sanmay Das, Edmund Durfee, Kate Larson, Michael Winikoff|
|Publisher||International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)|
|Number of pages||9|
|State||Published - 2017|
|Event||16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017 - Sao Paulo, Brazil|
Duration: 8 May 2017 → 12 May 2017
|Name||Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS|
|Conference||16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017|
|Period||8/05/17 → 12/05/17|
Bibliographical notePublisher Copyright:
© Copyright 2017, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.
- Distributed streams
- Sublinear algorithms