论文标题
人口协议模型中的均匀两人，具有任意通信图
Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs
论文作者
论文摘要
在本文中，我们重点介绍了人口协议模型中的统一两人问题。这个问题旨在将人口分为两组相等的群体。特别是，我们在\ emph {nutary}通信图的上下文中考虑了问题。结果，当人口中的代理人指定了初始状态（例如基本站的存在，协议的对称性以及执行的公平性）时，我们阐明了使用任意通信图的统一分两区问题的解决性。当问题可解决时，我们提出了均匀两性的协议。当假定全球公平性时，我们解决方案的空间复杂性就很紧张。
In this paper, we focus on the uniform bipartition problem in the population protocol model. This problem aims to divide a population into two groups of equal size. In particular, we consider the problem in the context of \emph{arbitrary} communication graphs. As a result, we clarify the solvability of the uniform bipartition problem with arbitrary communication graphs when agents in the population have designated initial states, under various assumptions such as the existence of a base station, symmetry of the protocol, and fairness of the execution. When the problem is solvable, we present protocols for uniform bipartition. When global fairness is assumed, the space complexity of our solutions is tight.
