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

01/19/2019
by   Emanuele Natale, et al.
0

We consider the Relative-Majority Problem (also known as Plurality), in which, given a multi-agent system where each agent is initially provided an input value out of a set of k possible ones, each agent is required to eventually compute the input value with the highest frequency in the initial configuration. We consider the problem in the general Population Protocols model in which, given an underlying undirected connected graph whose nodes represent the agents, edges are selected by a globally fair scheduler. The state complexity that is required for solving the Plurality Problem (i.e., the minimum number of memory states that each agent needs to have in order to solve the problem), has been a long-standing open problem. The best protocol so far for the general multi-valued case requires polynomial memory: Salehkaleybar et al. (2015) devised a protocol that solves the problem by employing O(k 2^k) states per agent, and they conjectured their upper bound to be optimal. On the other hand, under the strong assumption that agents initially agree on a total ordering of the initial input values, Gasieniec et al. (2017), provided an elegant logarithmic-memory plurality protocol. In this work, we refute Salehkaleybar et al.'s conjecture, by providing a plurality protocol which employs O(k^11) states per agent. Central to our result is an ordering protocol which allows to leverage on the plurality protocol by Gasieniec et al., of independent interest. We also provide a Ω(k^2)-state lower bound on the necessary memory to solve the problem, proving that the Plurality Problem cannot be solved within the mere memory necessary to encode the output.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/25/2019

Leader Election Requires Logarithmic Time in Population Protocols

In this paper, it is shown that any leader election problem requires log...
research
10/24/2021

New Bounds for the Flock-of-Birds Problem

In this paper, we continue a line of work on obtaining succinct populati...
research
03/18/2021

Fast Consensus via the Unconstrained Undecided State Dynamics

We consider the plurality consensus problem among n agents. Initially, e...
research
07/16/2018

Verification of Immediate Observation Population Protocols

Population protocols (Angluin et al., PODC, 2004) are a formal model of ...
research
02/25/2022

Complexity of Deliberative Coalition Formation

Elkind et al. (AAAI, 2021) introduced a model for deliberative coalition...
research
11/09/2021

Population Protocols for Graph Class Identification Problems

In this paper, we focus on graph class identification problems in the po...
research
09/18/2020

Approximate Majority With Catalytic Inputs

Third-state dynamics (Angluin et al. 2008; Perron et al. 2009) is a well...

Please sign up or login with your details

Forgot password? Click here to reset