arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/9810005cs.MAcs.AI
收藏

具有最坏情况保证的任意时间联盟结构生成

Anytime Coalition Structure Generation with Worst Case Guarantees

Tuomas Sandholm, Kate Larson, Martin Andersson, Onn Shehory, Fernando Tohme

摘要:

联盟形成是多智能体系统中的一个关键问题。人们会更喜欢一个联盟的价值总和最大化的联盟结构,但往往联盟结构的数量太大,不允许穷举搜索的最佳之一。但是,通过部分搜索找到的联盟结构能保证在最优范围内吗?我们发现,没有以前的联盟结构生成算法可以建立任何约束,因为他们搜索的节点比阈值,我们显示必要的建立一个绑定。我们提出了一个算法,建立了一个紧密的范围内,这个最小的搜索量,并表明,任何其他算法将不得不严格搜索。随着代理数量的增长,需要搜索的节点的比例接近于零。如果还有额外的时间,我们的随时算法会进一步搜索,并建立一个逐步降低的紧界。令人惊讶的是,只要再搜索一个节点,边界就会减半。正如所期望的,我们的算法降低了界限迅速早期,并表现出递减的计算回报。它也大大超过了它的明显竞争者。最后,我们将展示如何分配所需的搜索在自私的操纵代理。

英文摘要:

Coalition formation is a key topic in multiagent systems. One would prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coalition structures is too large to allow exhaustive search for the optimal one. But then, can the coalition structure found via a partial search be guaranteed to be within a bound from optimum? We show that none of the previous coalition structure generation algorithms can establish any bound because they search fewer nodes than a threshold that we show necessary for establishing a bound. We present an algorithm that establishes a tight bound within this minimal amount of search, and show that any other algorithm would have to search strictly more. The fraction of nodes needed to be searched approaches zero as the number of agents grows. If additional time remains, our anytime algorithm searches further, and establishes a progressively lower tight bound. Surprisingly, just searching one more node drops the bound in half. As desired, our algorithm lowers the bound rapidly early on, and exhibits diminishing returns to computation. It also drastically outperforms its obvious contenders. Finally, we show how to distribute the desired search across self-interested manipulative agents.

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

↑