Results 221 to 230 of about 5,615 (251)
Near-Optimal Anytime Coalition Structure Generation. [PDF]
, 2007 Forming effective coalitions is a major research challenge in the field of multi-agent systems. Central to this endeavour is the problem of determining the best set of agents that should participate in a given team. To this end, in this paper, we present a novel, anytime algorithms designed for this purpose.
Rahwan, T. +3 more
openaire +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Code-based Algorithm for Coalition Structure Generation
2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI), 2021Samir Aknine +2 more
exaly +3 more sources
Coalitional Structure Generation in Skill Games
Proceedings of the AAAI Conference on Artificial Intelligence, 2010We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games. In CSGs, the value of a coalition depends on the tasks its members can achieve. The tasks require various skills to complete them, and agents may have different skill sets.
Yoram Bachrach +3 more
openaire +1 more source
An Improved Algorithm for Optimal Coalition Structure Generation
Proceedings of the International Symposium on Combinatorial Search, 2021The Coalition Structure Generation (CSG) problem is a partitioning of a set of agents into exhaustive and disjoint coalitions to maximize social welfare. This NP-complete problem arises in many practical scenarios. Prominent examples are included in the field of transportation, e-Commerce, distributed sensor networks, and others.
Narayan Changder +2 more
openaire +2 more sources
Solution Concepts for Games with General Coalition Structure
SSRN Electronic Journal, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gleb A. Koshevoy, Dolf Talman
openaire +1 more source
Generalization of the social coalitional equilibrium structure
Economic Theory Bulletin, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ken Urai, Hiromi Murakami, Weiye Chen
openaire +2 more sources
Online Coalition Structure Generation in Graph Games
International Joint Conference on Autonomous Agents and Multiagent Systems, 2018We consider the online version of the coalition structure generation in graph games problem, where agents are vertices in a graph. After each step t , in which the t -th agent appears in an online fashion, agents are partitioned into $c(t)$ coalitions $\clust(t)=\\C_1^t, \C_2^t, łdots, \C_c(t) ^t \ $, such that every agent belongs to exactly one ...
M. Flammini +4 more
openaire +4 more sources
Coalition structure generation with given required bound based on coalition combination
2008 3rd International Conference on Intelligent System and Knowledge Engineering, 2008Coalition formation is a key topic in multi-agent systems. Most of these researches concentrate on how to form a coalition and assign the revenues of the coalition through negotiation. Another researching branch is to study the optimal division of agents into coalitions (the pairwise disjoint subsets) so that the sum of the revenues of all coalitions ...
Jianbin Luo, Shanli Hu, Yaohai Lin
openaire +1 more source
The generalized symmetric coalitional Banzhaf value for multichoice games with a coalition structure
Journal of Systems Science and Complexity, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fanyong Meng 0001 +2 more
openaire +1 more source
Non-Utilitarian Coalition Structure Generation
2016The coalition structure generation problem is one of the key challenges in multi-agent coalition formation. It involves partitioning a set of agents into coalitions so that system performance is optimized. To date, the multi-agent systems literature has focused exclusively on the utilitarian version of this problem which seeks to maximize the sum of ...
Oskar Skibski +6 more
openaire +1 more source