论文标题
与具有合作和拮抗关系的代理商的共识
Consensus for Clusters of Agents with Cooperative and Antagonistic Relationships
论文作者
论文摘要
在本文中，我们在网络代理的上下文中解决了共识问题，其通信图可以分为一定数量的群集，以至于同一簇中的代理之间的相互作用是协同合作的，而属于不同簇的代理之间的相互作用是拮抗的。此问题设置是在社交网络和意见动态的背景下出现的，在这种情况下，达成共识意味着代理人在同一集群中的意见融合了同一决定。在这里，在同一集群中的代理具有相同常数和预固定的信任（/不信任）的假设，在这里进行了共识问题。拟议的解决方案确定了同一组中的代理人必须对他们的意见保守，以便融合共同的决定。
In this paper we address the consensus problem in the context of networked agents whose communication graph can be split into a certain number of clusters in such a way that interactions between agents in the same clusters are cooperative, while interactions between agents belonging to different clusters are antagonistic. This problem set-up arises in the context of social networks and opinion dynamics, where reaching consensus means that the opinions of the agents in the same cluster converge to the same decision. The consensus problem is here investigated under the assumption that agents in the same cluster have the same constant and pre-fixed amount of trust (/distrust) to be distributed among their cooperators (/adversaries). The proposed solution establishes how much agents in the same group must be conservative about their opinions in order to converge to a common decision.
