arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.6475cs.MAcs.SI
收藏

多智能体系统中的分布式团队形成:稳定性与近似性

Distributed team formation in multi-agent systems: stability and approximation

Lorenzo Coviello, Massimo Franceschetti

摘要:

我们考虑一个场景,领导者需要招募追随者团队。每个领导者不能招募所有的追随者,但互动是根据一个二分网络的约束。每个领导者的目标是达到一种局部稳定的状态,在这种状态下,领导者控制着一个规模等于给定约束的团队。我们专注于分布式策略,代理只有本地信息的网络拓扑结构,并提出了一个分布式算法,领导者和追随者根据简单的本地规则行事。该算法的性能进行了分析相对于一个稳定的解决方案的收敛性。我们的结果如下。对于任何网络,所提出的算法收敛到一个近似的稳定的解决方案在多项式时间,即领导者迅速形成团队,其中所需的额外的追随者的总数,以满足所有团队规模的限制是一个任意小的部分,整个人口。相反,对于一般的图,在收敛到近似解和稳定解之间可能存在指数时间差。

英文摘要:

We consider a scenario in which leaders are required to recruit teams of followers. Each leader cannot recruit all followers, but interaction is constrained according to a bipartite network. The objective for each leader is to reach a state of local stability in which it controls a team whose size is equal to a given constraint. We focus on distributed strategies, in which agents have only local information of the network topology and propose a distributed algorithm in which leaders and followers act according to simple local rules. The performance of the algorithm is analyzed with respect to the convergence to a stable solution. Our results are as follows. For any network, the proposed algorithm is shown to converge to an approximate stable solution in polynomial time, namely the leaders quickly form teams in which the total number of additional followers required to satisfy all team size constraints is an arbitrarily small fraction of the entire population. In contrast, for general graphs there can be an exponential time gap between convergence to an approximate solution and to a stable solution.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑