models of communication and hierarchy restrictions in cooperative games, compare different network structures with each other …. Two well-known network structures are hierarchies and communication networks. We give an overview of the most common … and discuss network structures that combine communication as well as hierarchical features. Throughout the survey, we …

This chapter studies the theory of value of games with infinitely many players.Games with infinitely many players are …-handed influence. The interactions are modeled as cooperative games with a continuum of players. In general, the continuum consists of … framework for mathematical analysis, and approximates the results for large finite games well. Also, it enables a unified view …

which they usually take different positions. Two examples of such structures are communication networks and hierarchies. In … feasible sets in communication networks and compare them with feasible sets arising from hierarchies. …

which they usually take different positions. Two examples of such structures are communication networks and hierarchies. In … feasible sets in communication networks and compare them with feasible sets arising from hierarchies. …

In this paper we introduce an extension of the model of restricted communication in cooperative games as introduced in … Myerson (1977) by allowing communication links to be directed and the worth of a coalition to depend on the order in which the … players enter the coalition. Therefore, we model the communication network by a directed graph and the cooperative game by a …

We study cooperative games with communication structure, represented by an undirected graph. Players in the game are …-convexity is weaker than convexity. For games with a cycle-free communication structure, link-convexity is even weaker than super-additivity. … proposed for this class of games. Given the graph structure we define a collection of spanning trees, where each spanning tree …

We introduce an efficient solution for games with communication graph structures and show that it is characterized by … communication graph the total payoff to the players of this component in the game itself to the total payoff of these players when …

Herings et al. (2008) proposed a solution concept called the average tree solution for cycle-free graph games. We … provide a characterization of the average tree solution for cycle-free graph games. The characterization underlines an … (Myerson, 1977) for cycle-free graph games …