Space-optimal proportion consensus with population protocols

Abstract

Population protocols provide a distributed computing model in which a set of finite-state identical agents cooperate through random interactions, between neighbors in the interaction graph, to collectively carry out a computation in a distributed setting. Population protocols have become very popular in various research areas, such as distributed computing, sensor or social networks, as well as chemistry and biology. A central task in this model is majority computation, in which agents need to reach an agreement on the leading one of two possible initial opinions. In this paper we consider a generalization of the majority problem, named proportion consensus, which asks for an agreement on the proportion of one opinion, between two possible views (say A or B). The objective is to reach a configuration where all the agents agree on a range γA ⊆ [0,1] which contains the value of the fraction ρA of agents that started with view A; the goal is to get the size of γA as small as possible while also minimizing the number of states adopted by agents. We provide a lower bound on the trade-off between precision ϵ (the size of γA) and the number of states required by any population protocol that solves the proportion consensus problem. In particular, we show that in any population protocol that solves the proportion consensus problem with precision ϵ, any agent must have at least ⌈2/ϵ⌉ states. We also provide a population protocol that exactly solves the proportion consensus problem with precision ϵ and 6⌈1/(2ϵ)⌉ - 1 states. We show that in case of an arbitrary interaction graph our protocol requires O(n6/ϵ)interactions (which corresponds to the number of rounds in the sequential communication model) on any network with n agents. On complete interaction networks, the expected number of required interactions is O(n2 log n). Using the random matching communication model, the expected number of rounds, required to reach a consensus, decreases to O(Δ n4/ϵ) in case of arbitrary interaction networks (where Δ denotes the maximum degree among the agents in the network) and O(n log n) for complete networks.