资源分类
》 资源 》论文》A COP Model for Graph-Constrained Coalition Formation (Extended Abstract) Filippo Bistaffa1 and Alessandro Farinelli2

A COP Model for Graph-Constrained Coalition Formation (Extended Abstract) Filippo Bistaffa1 and Alessandro Farinelli2

2019-11-06 | |  64 |   40 |   0
Abstract We focus on Graph-Constrained Coalition Formation (GCCF), a widely studied subproblem of coalition formation where the set of valid coalitions is constrained by a graph. We propose COP-GCCF, a novel approach that models GCCF as a COP. We then solve such COP with a highly-parallel GPU implementation of Bucket Elimination, which is able to exploit the high constraint tightness of COPGCCF. Results on realistic graphs, i.e., a crawl of the Twitter social graph, show that our approach outperforms state of the art algorithms (i.e., DyCE and IDPG ) by at least one order of magnitude, both in terms of runtime and memory.

上一篇：MCTS-Minimax Hybrids with State Evaluations (Extended Abstract)? Hendrik Baier1 and Mark H. M. Winands2

下一篇：On the Logical Properties of the Description Logic DLN (Extended abstract)? Piero A. Bonatti and Luigi Sauro

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Joint Pose and Ex...

    Facial expression recognition (FER) is a challe...