Space-Optimal Population Protocols for Uniform Bipartition Under Global Fairness

In this paper, we consider a uniform bipartition problem in a population protocol model. The goal of the uniform bipartition problem is to divide a population into two groups of the same size. We study the problem under global fairness with various assumptions: 1) a population with or without a base...

Full description

Saved in:
Bibliographic Details
Published inIEICE Transactions on Information and Systems Vol. E102.D; no. 3; pp. 454 - 463
Main Authors YASUMI, Hiroto, OOSHITA, Fukuhito, YAMAGUCHI, Ken'ichi, INOUE, Michiko
Format Journal Article
LanguageEnglish
Published Tokyo The Institute of Electronics, Information and Communication Engineers 01.03.2019
Japan Science and Technology Agency
Subjects
distributed protocol
Lower bounds
Population
population protocol
uniform bipartition
Online AccessGet full text

Cover

More Information
Summary:In this paper, we consider a uniform bipartition problem in a population protocol model. The goal of the uniform bipartition problem is to divide a population into two groups of the same size. We study the problem under global fairness with various assumptions: 1) a population with or without a base station, 2) symmetric or asymmetric protocols, and 3) designated or arbitrary initial states. As a result, we completely clarify solvability of the uniform bipartition problem under global fairness and, if solvable, show the tight upper and lower bounds on the number of states.
ISSN:0916-8532
1745-1361
DOI:10.1587/transinf.2018FCP0009