Majority Determination in Binary-valued Communication Networks
Majority Determination in Binary-valued Communication Networks
复制标题
二值通信网络中的多数决定
DOI：
10.1109/tcns.2020.3038839
复制
发表时间：
2021
影响因子：
4.2
通讯作者：
Nagahara Masaaki
中科院分区：
文献类型：
--
作者：
Azuma Shun-Ichi;Nagahara Masaaki
多数决定是多智能体系统的基本问题之一。它旨在协作和分布式地确定网络中代理的多数意见，其中代理最初投票“赞成”或“反对”一项提案。这个问题的一个有趣的方面是澄清代理之间确定多数所需的最低通信分辨率。在本研究中，我们用二值通信来解决这个问题。为了克服通信信道容量有限的限制，我们利用随机化通信，即发送根据概率分布选择的二进制值（0或1）。基于这个想法，我们开发了共识型算法，以任意规定的精度近似解决问题。
Majority determination is one of the fundamental problems in multiagent systems. It aims to cooperatively and distributedly determine the majority opinion of agents in a network, where the agents initially vote “in favor of” or “opposed” a proposal. An interesting aspect of this issue is to clarify the lowest resolution of communication required among the agents to determine the majority. In this study, we address this problem with binary-valued communication. To overcome the limitation of the finite capacity of communication channels, we exploit randomized communication, i.e., sending binary values (0 or 1), which are selected according to a probabilistic distribution. Based on this idea, we develop consensus-type algorithms that approximately solve the problem with an arbitrarily prescribed accuracy.