ResearchTrend.AI
On the Necessary Memory to Compute the Plurality in Multi-Agent Systems

On the Necessary Memory to Compute the Plurality in Multi-Agent Systems

Emanuele Natale
Iliad Ramezani
ArXiv (abs)PDFHTML

Papers citing "On the Necessary Memory to Compute the Plurality in Multi-Agent Systems"

4 / 4 papers shown
Title
Population Protocols for Exact Plurality Consensus -- How a small chance of failure helps to eliminate insignificant opinions
Population Protocols for Exact Plurality Consensus -- How a small chance of failure helps to eliminate insignificant opinions
Gregor Bankhamer
Petra Berenbrink
Felix Biermeier
Robert Elsässer
Hamed Hosseinpour
Dominik Kaaser
Peter Kling
93
7
0
09 Feb 2024
Fast Convergence of $k$-Opinion Undecided State Dynamics in the Population Protocol Model
Fast Convergence of kk-Opinion Undecided State Dynamics in the Population Protocol Model
Talley Amir
J. Aspnes
Petra Berenbrink
Felix Biermeier
Christopher Hahn
Dominik Kaaser
John Lazarsfeld
51
6
0
24 Feb 2023
On the Hierarchy of Distributed Majority Protocols
On the Hierarchy of Distributed Majority Protocols
Petra Berenbrink
A. Coja-Oghlan
Oliver Gebhard
Max Hahn-Klimroth
Dominik Kaaser
M. Rau
41
3
0
17 May 2022
Fast Consensus via the Unconstrained Undecided State Dynamics
Fast Consensus via the Unconstrained Undecided State Dynamics
Gregor Bankhamer
Petra Berenbrink
Felix Biermeier
Robert Elsässer
Hamed Hosseinpour
Dominik Kaaser
Peter Kling
91
12
0
18 Mar 2021