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

现实世界中图约束联盟形成算法

Algorithms for Graph-Constrained Coalition Formation in the Real World

University of Verona(维罗纳大学);IIIA-CSIC(西班牙国家研究委员会人工智能研究所);University of Southampton(南安普顿大学)

Filippo Bistaffa, Alessandro Farinelli, Jesús Cerquides, Juan A. Rodríguez-Aguilar, Sarvapali D. Ramchurn

AI总结:

本文针对图约束联盟形成问题,提出基于边收缩的搜索空间树表示和随时求解算法CFSS,并通过非冗余并行划分实现高效求解,在真实能耗数据集上验证其性能显著优于现有方法,且首次支持超过2700个智能体的大规模系统。

摘要:

联盟形成通常涉及多个异构智能体聚集在一起,以实现其个体和集体目标。在本文中,我们聚焦于联盟形成的一个特例,称为图约束联盟形成(Graph-Constrained Coalition Formation,GCCF),其中连接智能体的网络约束了联盟的形成。我们关注这类问题是因为在许多现实世界应用中,智能体可能通过通信网络连接,或者只信任其社交网络中的某些同伴。我们基于边收缩(edge contraction)的概念提出了一种新颖的问题表示方法,该方法使我们能够将GCCF问题诱导的搜索空间建模为一棵有根树。然后,我们提出了一种随时求解算法(CFSS),该算法在应用于一类称为$m+a$函数的一般特征函数时特别高效。此外,我们展示了如何高效地并行化CFSS,利用搜索空间的非冗余划分来求解GCCF。我们使用一个包含英国大量家庭能源消耗的真实世界数据集,在合成场景和现实场景上对CFSS进行了基准测试。我们的结果表明,在最佳情况下,CFSS的串行版本比现有最优方法快4个数量级,而并行版本在12核机器上比串行版本快9.44倍。此外,CFSS是首个为超大规模智能体系统(即超过2700个智能体)提供具有质量保证的随时近似解的方法。

英文摘要:

Coalition formation typically involves the coming together of multiple, heterogeneous, agents to achieve both their individual and collective goals. In this paper, we focus on a special case of coalition formation known as Graph-Constrained Coalition Formation (GCCF) whereby a network connecting the agents constrains the formation of coalitions. We focus on this type of problem given that in many real-world applications, agents may be connected by a communication network or only trust certain peers in their social network. We propose a novel representation of this problem based on the concept of edge contraction, which allows us to model the search space induced by the GCCF problem as a rooted tree. Then, we propose an anytime solution algorithm (CFSS), which is particularly efficient when applied to a general class of characteristic functions called $m+a$ functions. Moreover, we show how CFSS can be efficiently parallelised to solve GCCF using a non-redundant partition of the search space. We benchmark CFSS on both synthetic and realistic scenarios, using a real-world dataset consisting of the energy consumption of a large number of households in the UK. Our results show that, in the best case, the serial version of CFSS is 4 orders of magnitude faster than the state of the art, while the parallel version is 9.44 times faster than the serial version on a 12-core machine. Moreover, CFSS is the first approach to provide anytime approximate solutions with quality guarantees for very large systems of agents (i.e., with more than 2700 agents).

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

↑