arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1401.3466cs.MAcs.AI
收藏

一种最优联盟结构生成的Anytime算法

An Anytime Algorithm for Optimal Coalition Structure Generation

University of Southampton(南安普顿大学);Pompeu Fabra University(庞培法布拉大学)

Talal Rahwan, Sarvapali Dyanand Ramchurn, Nicholas Robert Jennings, Andrea Giovannucci

摘要:

联盟形成是一种基本类型的互动,它涉及到建立不同的、自主的、协调一致的群体,以便有效地实现其个人或集体目标。形成有效的联盟是多智能体系统领域的一个主要研究挑战。这一努力的核心问题是,为了实现某个目标,确定在许多可能的联盟中形成哪一个。这通常需要计算每一个可能的联盟的价值,称为联盟价值,这表明如果联盟成立,它将有多大的好处。一旦计算出这些值,代理通常需要找到一个联盟的组合,其中每个代理都属于一个联盟,并且系统的整体结果最大化。然而,这个联盟结构生成问题是极具挑战性的,由于需要检查的可能的解决方案的数量,这与所涉及的代理的数量呈指数级增长。因此,到目前为止,已经提出了许多算法来解决这个问题,使用不同的技术,从动态规划,整数规划,随机搜索,所有这些都受到有关的执行时间,解决方案的质量,和内存需求的主要限制。考虑到这一点,我们开发了一个随时算法来解决联盟结构生成问题。具体而言,该算法使用了一种新的表示的搜索空间,它分区的空间可能的解决方案到子空间,这样就有可能计算的最佳联盟结构的值的上限和下限。然后,这些边界用于识别没有包含最优解的可能性的子空间,以便可以修剪它们。然后,该算法使用分支定界技术非常有效地搜索剩余的子空间,以避免检查搜索子空间内的所有解。在这种情况下,我们证明了我们的算法枚举所有联盟结构有效地避免冗余和无效的解决方案自动。此外,为了有效地测试我们的算法,我们开发了一种新型的输入分布,使我们能够生成更可靠的基准相比,以前在该领域使用的输入分布。鉴于这种新的分布,我们表明,对于27个代理,我们的算法是能够找到最佳的解决方案,在文献中最快的算法所需的时间的0.175%。该算法是任何时候,如果中断之前,它将正常终止,它仍然可以提供一个解决方案,保证是在一个界限内的最佳。此外,我们提供的解决方案的质量的保证是显着优于那些提供的最先进的算法设计用于此目的。例如,对于给定25个代理的最坏情况分布,我们的算法能够在大约10%的时间内找到90%的有效解决方案。

英文摘要:

Coalition formation is a fundamental type of interaction that involves the creation of coherent groupings of distinct, autonomous, agents in order to efficiently achieve their individual or collective goals. Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining which of the many possible coalitions to form in order to achieve some goal. This usually requires calculating a value for every possible coalition, known as the coalition value, which indicates how beneficial that coalition would be if it was formed. Once these values are calculated, the agents usually need to find a combination of coalitions, in which every agent belongs to exactly one coalition, and by which the overall outcome of the system is maximized. However, this coalition structure generation problem is extremely challenging due to the number of possible solutions that need to be examined, which grows exponentially with the number of agents involved. To date, therefore, many algorithms have been proposed to solve this problem using different techniques ranging from dynamic programming, to integer programming, to stochastic search all of which suffer from major limitations relating to execution time, solution quality, and memory requirements. With this in mind, we develop an anytime algorithm to solve the coalition structure generation problem. Specifically, the algorithm uses a novel representation of the search space, which partitions the space of possible solutions into sub-spaces such that it is possible to compute upper and lower bounds on the values of the best coalition structures in them. These bounds are then used to identify the sub-spaces that have no potential of containing the optimal solution so that they can be pruned. The algorithm, then, searches through the remaining sub-spaces very efficiently using a branch-and-bound technique to avoid examining all the solutions within the searched subspace(s). In this setting, we prove that our algorithm enumerates all coalition structures efficiently by avoiding redundant and invalid solutions automatically. Moreover, in order to effectively test our algorithm we develop a new type of input distribution which allows us to generate more reliable benchmarks compared to the input distributions previously used in the field. Given this new distribution, we show that for 27 agents our algorithm is able to find solutions that are optimal in 0.175% of the time required by the fastest available algorithm in the literature. The algorithm is anytime, and if interrupted before it would have normally terminated, it can still provide a solution that is guaranteed to be within a bound from the optimal one. Moreover, the guarantees we provide on the quality of the solution are significantly better than those provided by the previous state of the art algorithms designed for this purpose. For example, for the worst case distribution given 25 agents, our algorithm is able to find a 90% efficient solution in around 10% of time it takes to find the optimal solution.

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

↑