A different perspective from the more “traditional” approaches to studying solutions of games in partition function form has been presented. We provide a decomposition of the space of such games under the action of the symmetric group, for the cases with three and four players. In particular, we identify all the irreducible subspaces that are relevant to the study of linear symmetric solutions. We then use such a decomposition to derive a characterization of the class of linear and symmetric solutions, as well as of the class of linear, symmetric and efficient solutions.
We present the relationship between network games and representation theory of the group of permutations of the set of players (nodes), and also offer a different perspective to study solutions for this kind of problems. We then provide several applications of this approach to the cases with three and four players.
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.