The authors consider the problem of multi-choice majority voting in a network of n agents where each agent initially selects a choice from a set of K possible choices. The agents try to infer the choice in the majorit...
详细信息
The authors consider the problem of multi-choice majority voting in a network of n agents where each agent initially selects a choice from a set of K possible choices. The agents try to infer the choice in the majority merely by performing local interactions. Extending the popular 'Population Protocol' framework for pairwise interactions between agents, in this study, they propose a new model called 'broadcasting Population Protocol'. In the proposed model, each agent broadcasts its messages in such a way that all its neighbours will receive the message simultaneously. They design two distributedalgorithms for solving the multi-choice majority voting problem in this new model. They show that these algorithms return the correct output, i.e. the choice in the majority. They also analyse their performances in terms of time and message complexities. They establish via simulations that the proposed algorithms improve both time and message complexities significantly with respect to previous algorithms proposed in conventional population protocols, and they can be utilised in networks where messages can be transmitted to a subset of agents simultaneously, such as wireless networks.
暂无评论