On the necessary memory to compute the plurality in multi-agent systems

DOI10.1007/978-3-030-17402-6_27OpenAlexW2913211769MaRDI QIDQ2294063FDOQ2294063

Authors: Emanuele Natale, Iliad Ramezani 

Publication date: 6 February 2020

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

Recommendations

• Efficient plurality consensus, or: the benefits of cleaning up from time to time
• Deterministic population protocols for exact majority and plurality
• A polylogarithmic gossip algorithm for plurality consensus
• Fast and exact majority in population protocols
• Determining majority in networks with local interactions and very small local memory

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited In (3)

• Title not available (Why is that?)
• Invited paper: One bit agent memory is enough for snap-stabilizing perpetual exploration of cactus graphs with distinguishable cycles
• Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model

This page was built for publication: On the necessary memory to compute the plurality in multi-agent systems

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