.png){kind=icon}
.png){kind=icon}
Return
Majority Determination in Binary-Valued Communication Networks
.png){kind=icon}
OA
AI
DOI：10.1109/TCNS.2020.3038839.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Binary-valued communication
decision making
majority determination
multiagent system
Journal
IF:
5
Papers:
1.6K
Citations:
5.8K