最优联盟结构生成的分层动态规划算法
A Hierarchical Dynamic Programming Algorithm for Optimal Coalition Structure Generation
摘要:
我们提出了一个新的动态规划(DP)制定的联盟结构生成(CSG)问题的基础上施加一个层次的组织结构的代理。我们证明了这种配方的效率,通过推导DyPE,一种新的最佳DP算法,显着优于目前的DP方法的速度和内存使用。在经典的情况下,所有的联盟都是可行的,DyPE的内存需求是其他DP方法的一半。在图限制的CSG上,其中可行性受到(协同)图的限制,DyPE具有相同或更低的计算复杂性,这取决于问题的底层图结构。我们的经验评估表明,DyPE优于国家的最先进的DP方法的几个数量级,在大范围的图形结构(例如,对于某些无标度图DyPE减少内存需求的$10^6$,并解决了以前需要几个小时的问题,在几分钟内)。
英文摘要:
We present a new Dynamic Programming (DP) formulation of the Coalition Structure Generation (CSG) problem based on imposing a hierarchical organizational structure over the agents. We show the efficiency of this formulation by deriving DyPE, a new optimal DP algorithm which significantly outperforms current DP approaches in speed and memory usage. In the classic case, in which all coalitions are feasible, DyPE has half the memory requirements of other DP approaches. On graph-restricted CSG, in which feasibility is restricted by a (synergy) graph, DyPE has either the same or lower computational complexity depending on the underlying graph structure of the problem. Our empirical evaluation shows that DyPE outperforms the state-of-the-art DP approaches by several orders of magnitude in a large range of graph structures (e.g. for certain scalefree graphs DyPE reduces the memory requirements by $10^6$ and solves problems that previously needed hours in minutes).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。