There is an extensive literature that studies situations of restricted cooperation in cooperative games. Myerson (1979) introduced communication graph games, where players can only cooperate if they are connected in an undirected graph representing the communication possibilities. The Myerson...

There is an extensive literature that studies situations of restricted cooperation in cooperative games. Myerson (1979) introduced communication graph games, where players can only cooperate if they are connected in an undirected graph representing the communication possibilities. The Myerson...

There is an extensive literature that studies situations of restricted cooperation in cooperative games. Myerson (1979) introduced communication graph games, where players can only cooperate if they are connected in an undirected graph representing the communication possibilities. The Myerson...

Agents participating in different kind of organizations, usually take different positions in some relational structure. The aim of this paper is to introduce a new framework taking into account both communication and hierachical features derived from this participation. In fact, this new set or...

In the literature, there exist several models where a cooperative TU-game is enriched with a hierarchical structure on the player set that is represented by a digraph. We consider games under precedence constraints introduced by Faigle and Kern (1992) who also introduce a generalization of the...

In the literature, there exist several models where a cooperative TU-game is enriched with a hierarchical structure on the player set that is represented by a digraph. We consider games under precedence constraints introduced by Faigle and Kern (1992) who also introduce a generalization of the...

Agents participating in different kind of organizations, usually take different positions in some relational structure. The aim of this paper is to introduce a new framework taking into account both communication and hierachical features derived from this participation. In fact, this new set or...

A situation in which a finite set of agents can generate certain payoffs by cooperation can be described by a cooperative game with transferable utility (or simply a TU-game) where each agent is represented by one player in the game. In this paper, we assume that one agent can be represented by...

It is known that peer group games are a special class of games with a permission structure. However, peer group games are also a special class of (weighted) digraph games. To be specific, they are digraph games in which the digraph is the transitive closure of a rooted tree. In this paper we...