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 …

We examine a new class of games, which we call social games, where players not only choose strategies but also choose … players in different roles, among other things. We also examine finite repetitions of games where players may choose to … rematch in any period. Some equilibria of fixed-player repeated games cannot be sustained as equilibria in a repeated social …

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 …

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 …

communication structure, the so-called hypergraph games. A hypergraph communication structure is given by a collection of coalitions …We consider transferable utility cooperative games (TU games) with limited cooperation introduced by hypergraph … hyperlinks are able to cooperate and realize their worth. We introduce the average tree value for hypergraph games, which assigns …

In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cycle …-free communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate …

We introduce an Owen-type value for games with two-level communication structures, being structures where the players … Aumann-Dreze value for games with coalition structures, the Myerson value for communication graph games and the equal surplus … are partitioned into a coalition structure such that there exists restricted communication between as well as within the a …

games. That is, we propose a non-cooperative mechanism of which the unique subgame perfect equilibrium payoffs correspond to …

games based on the idea of the Average Tree value for cycle-free communication graph games. We provide two axiomatizations …In the literature various models of games with restricted cooperation can be found. In those models, instead of …