The paper aims at generalizing the notion of restricted game on a communication graph, introduced by Myerson. We consider communication graphs with weighted edges, and we define arbitrary ways of partitioning any subset of a graph, which we call correspondences. A particularly useful way to...

The paper aims at generalizing the notion of restricted game on a communication graph, introduced by Myerson. We consider communication graphs with weighted edges, and we define arbitrary ways of partitioning any subset of a graph, which we call correspondences. A particularly useful way to...

We study cooperative games associated with a communication structure which takes into account a level of communication between players. Let us consider an undirected communication graph : each node represents a player and there is an edge between two nodes if the corresponding players can...

In a standard TU-game it is assumed that every subset of the player set can form a coalition and earn its worth. One of the first models where restrictions in cooperation are considered is the one of games with coalition structure. In such games the player set is partitioned into unions and...

A cooperative game with transferable utility describes a situation inwhich players can obtain certain payoffs by cooperation. A sharefunction for such games is a function which assigns for every game adistribution of the payoffs over the players in the game.In this paper we consider cooperative...