Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Distributed, Parallel, and Cluster Computing

arXiv:1805.04586 (cs)
[Submitted on 11 May 2018 (v1), last revised 17 Jul 2020 (this version, v3)]

Title:Time-space Trade-offs in Population Protocols for the Majority Problem

Authors:Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik
View PDF
Abstract:Population protocols are a model for distributed computing that is focused on simplicity and robustness. A system of $n$ identical agents (finite state machines) performs a global task like electing a unique leader or determining the majority opinion when each agent has one of two opinions. Agents communicate in pairwise interactions with randomly assigned communication partners. Quality is measured in two ways: the number of interactions to complete the task and the number of states per agent. We present protocols for the majority problem that allow for a trade-off between these two measures. Compared to the only other trade-off result [Alistarh, Gelashvili, Vojnovic; PODC'15], we improve the number of interactions by almost a linear factor. Furthermore, our protocols can be made uniform (working correctly without any information on the population size $n$), yielding the first uniform majority protocols that stabilize in a subquadratic number of interactions.
Subjects: Distributed, Parallel, and Cluster Computing (cs.DC)
Cite as: arXiv:1805.04586 [cs.DC]
  (or arXiv:1805.04586v3 [cs.DC] for this version)
  https://doi.org/10.48550/arXiv.1805.04586
Related DOI: https://doi.org/10.1007/s00446-020-00385-0

Submission history

From: Peter Kling [view email]
[v1] Fri, 11 May 2018 20:43:15 UTC (109 KB)
[v2] Sat, 23 Jun 2018 06:10:21 UTC (109 KB)
[v3] Fri, 17 Jul 2020 15:43:24 UTC (71 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.DC
< prev   |   next >
new | recent | 2018-05
Change to browse by:
cs

References & Citations

DBLP - CS Bibliography

listing | bibtex
Petra Berenbrink
Robert Elsässer
Tom Friedetzky
Dominik Kaaser
Peter Kling
…
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)