Results 11 to 20 of about 5,615 (251)
An Anytime Algorithm for Optimal Coalition Structure Generation [PDF]
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.
Talal Rahwan +3 more
openaire +6 more sources
Anytime coalition structure generation on synergy graphs [PDF]
We consider the coalition structure generation (CSG) problem on synergy graphs, which arises in many practical applications where communication constraints, social or trust relationships must be taken into account when forming coalitions. We propose a novel representation of this problem based on the concept of edge contraction, and an innovative ...
Bistaffa, Filippo +4 more
openaire +5 more sources
Complexity of coalition structure generation [PDF]
We revisit the coalition structure generation problem in which the goal is to partition the players into exhaustive and disjoint coalitions so as to maximize the social welfare. One of our key results is a general polynomial-time algorithm to solve the problem for all coalitional games provided that player types are known and the number of player types
H. Aziz, B. de Keijzer (Bart)
core +6 more sources
8 pages, 2 figures, 1 ...
Supreeth Mysore Venkatesh +2 more
openaire +3 more sources
Solving the Coalition Structure Generation Problem on a GPU [PDF]
We develop the first parallel algorithm for Coalition Structure Generation (CSG), which is central to many multi-agent systems applications. Our approach involves distributing the key steps of a dynamic programming approach to CSG across computational nodes on a Graphics Processing Unit (GPU) such that each of the thousands of threads of computation ...
Svensson, Kim +4 more
openaire +2 more sources
Optimal coalition structure generation strategy in multi-task concurrent edge computing environment
A discrete recent past-position updating strategy based m-ary discrete particle swarm optimization (MDPSO-DRPPUS) algorithm was proposed for the problem of large search space and low efficiency when solving the optimal coalition structure.First, the ...
Shuxu ZHAO, Ping WEI, Xiaolong WANG
doaj +2 more sources
Power grids include entities such as home-microgrids (H-MGs), consumers, and retailers, each of which has a unique and sometimes contradictory objective compared with others while exchanging electricity and heat with other H-MGs.
Jaber Valinejad +4 more
doaj +1 more source
A Hierarchical Clustering Algorithm for Interference Management in Ultra-Dense Small Cell Networks
Ultra-dense small cell networks (UD-SCNs) will be an integral part of next generation network (NGN). How to deal with serious interference is one of the important challenges in a UD-SCN.
Guang Yang +5 more
doaj +1 more source
Optimization of Optimal Coalition Structure Generation Strategy Based on Improved DQN [PDF]
Edge servers often need to collaborate to execute tasks by forming alliances when resources are limited. Ensuring that tasks can be completed as quickly as possible while reducing the cost of restructuring alliances is a major challenge considering the ...
ZHAO Shuxu, ZHOU Hongze, WANG Xiaolong
doaj +1 more source
Grasp and Path-Relinking for Coalition Structure Generation [PDF]
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition (maximizing a social welfare) of a set of entities involved in a system. The solution of the CSG problem finds applications in many fields such as Machine Learning (set covering machines ...
Nicola Di Mauro +3 more
openaire +3 more sources

