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.
A Multiagent Path Search Algorithm for Large-Scale Coalition Structure Generation
Clermont Auvergne University(克莱蒙奥弗涅大学);Clermont Auvergne INP(克莱蒙奥弗涅国立综合理工学院);CNRS(法国国家科学研究中心);LIMOS(利莫什科学与技术实验室);Univ Lyon(里昂大学);UCBL(里昂第一大学);INSA Lyon(里昂国立应用科学学院);Centrale Lyon(里昂中央理工学院);Univ Lyon 2(里昂第二大学);LIRIS(里昂信息、图像与智能系统实验室);Laboratory of Applied Mathematics, Faculty of Exact Sciences, University of Bejaia(贝贾亚大学精确科学学院应用数学实验室);TCG Centres for Research and Education in Science and Technology(TCG科学技术研究与教育中心);Carnegie Mellon University(卡内基梅隆大学);Strategy Robot, Inc.(Strategy Robot公司);Strategic Machine, Inc.(Strategic Machine公司);Optimized Markets, Inc.(Optimized Markets公司)
Faster Optimal Coalition Structure Generation via Offline Coalition Selection and Graph-Based Search
Univ Lyon(里昂大学);UCBL(里昂第一大学);CNRS(法国国家科学研究中心);INSA Lyon(里昂国立应用科学学院);Centrale Lyon(里昂中央理工学院);Univ Lyon 2(里昂第二大学);University of Bejaia(贝贾亚大学);TCG Centres for Research and Education in Science and Technology(TCG科学技术研究与教育中心);Carnegie Mellon University(卡内基梅隆大学);Strategy Robot, Inc.(战略机器人公司);Strategic Machine, Inc.(战略机器公司);Optimized Markets, Inc.(优化市场公司)
Cooperative Game-Theoretic Credit Assignment for Multi-Agent Policy Gradients via the Core
Key Laboratory of Intelligence, Games and Information Processing in Shaanxi Province(陕西省智能信息处理重点实验室);Unmanned System Research Institute(无人系统研究院);Northwestern Polytechnical University(西北工业大学);School of Mathematics and Statistics(数学与统计学院);Information Science Academy(信息科学学院);China Electronics Technology Group Corporation(中国电子科技集团有限公司)
Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
Department of Theoretical Computer Science, Faculty of Information Technology(理论计算机科学系);Université Clermont Auvergne, CNRS, Clermont Auvergne INP, Mines Saint-Étienne, LIMOS(克莱蒙特-奥弗涅大学);G-SCOP, Grenoble-INP(格勒诺布尔INP);Computer Science Institute, Faculty of Mathematics and Physics(数学与物理系计算机科学研究所)