Restricted games by union stable systems

Several models of partial cooperation have been proposed, among which are those derived from communication situations as introduced by Myerson [182]. In Myerson’s model, the bilateral relations among the players are represented by means of an undirected graph and the feasible coalitions are those that induce connected subgraphs. However, partial cooperation can not always be modelled by a graph, so the communication model has been generalized in several directions, for instance towards conference structures by Myerson [183] and hypergraph communication situations by van den Nouweland, Borm and Tijs [188].