We consider the issue of representing coalitional games in multi-agent systems
with externalities, i.e. in systems where the performance of one coalition may
be affected by the functioning of other co-existing coalitions. On top of the
conventional partition function game representation (PFG), we propose a number
of new representations based on a new notion of externalities. In contrast to
conventional game theory, our new concept is not related to the process by which
the coalitions are formed, but rather to the effect that each coalition may have
on the entire system and vice versa. We show that the new representations are
fully expressive and, for many classes of games, more concise than the
conventional PFG one. Building upon the new representations, we propose a number
of approaches to solve the coalition structure generation problem in systems
with externalities. We show that, if externalities are characterised by various
degrees of regularity, the new representations allow us to adapt some of the
algorithms that were originally designed for domains with no externalities so
that they can be used when externalities are present. Finally, building upon
Rahwan et al. and Michalak et al., we present a unified method to solve the
coalition structure generation problem in any system, with or without
externalities, provided sufficient information is available.
|