This paper studies the payoff structure of stable cooperation structures in link formation games. Players choose non-cooperatively with whom they want to form a link, and the payoffs are given by the Myerson value of the cooperation structure obtained. We characterize the class of TU-games that...

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A solution for TU-games assigns a set of payoff distributions (possibly empty or consisting of a unique element) to every...

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 with one another. We introduce a new...

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...

We consider cooperative transferable utility games, or simply TU-games, with a limited communication structure in which players can cooperate if and only if they are connected in the communication graph. A difference between the restricted Banzhaf value and the Myerson value (i.e. the Shapley...

We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called component balancedness. This latter axiom compares for every component in the communication graph the total payoff to the players of...

This paper analyzes Harsanyi power solutions for cooperative games in which partial cooperation is based on union stable systems. These structures contain as particular cases the widely studied communication graph games and permission structures, among others. In this context, we provide...

Cooperative games with partial cooperation cover a wider rank of real world situations than the classic model of cooperative games where every subset of a set of agents can form a coalition to execute the game. In this paper, the set of feasible coalitions which models the partial cooperation...

We introduce an Owen-type value for games with two-level communication structures, being structures where the players are partitioned into a coalition structure such that there exists restricted communication between as well as within the a priori unions of the coalition structure. Both types of...

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...