The coalition structure generation problem is a natural abstraction of one of the most
important challenges in multi-agent systems: How can a number of agents divide …

A coalition as a group of agents aims to work jointly to earn much more gains as a result of
their cooperation. Many existing studies assumed that members take advantage of joining …

The Shapley value---probably the most important normative payoff division scheme in
coalitional games---has recently been advocated as a useful measure of centrality in …

Previous approaches to select agents to form a team rely on single-agent capabilities, and
team performance is treated as a sum of such known capabilities. Motivated by complex …

I became interested in partition function form games early in my academic career and, by
now, have a few publications on the topic. Such games are not new but it was often difficult …

Algorithms for NP-complete problems often have different strengths andweaknesses, and
thus algorithm portfolios often outperform individualalgorithms. It is surprisingly difficult to …

Abstract The Shapley Value is arguably the most important normative solution concept in
coalitional games. One of its applications is in the domain of networks, where the Shapley …

This paper presents a new way of formalizing the coalition structure generation problem
(CSG) so that we can apply constraint optimization techniques to it. Forming effective …

Genetic algorithms have proved to be a useful improvement heuristic for tackling several
combinatorial problems, including the coalition structure generation problem. In this case …

ABSTRACT A Coalition Structure Generation (CSG) problem involves partitioning a set of
agents into coalitions so that the social surplus is maximized. Recently, Ohta et al …