We explore a broad class of values for cooperative games in characteristic function form, known as compromise values. These values efficiently allocate payoffs by linearly combining wellspecified upper and lower bounds on payoffs. We identify subclasses of games that admit nontrivial efficient...

Recently, cooperative game theory has been applied to various economic allocation problems in which players are not fully anonymous but belong to some relational structure. One of the most developed models in this respect are communications situations or (symmetric) network situations in which...

A situation in which a finite set of players can generate certain payoffs by cooperation can be described by a cooperative game with transferable utility. A solution for TU-games assigns to every TU-game a distribution of the payoffs that can be earned over the individual players. Two well-known...

In the field of cooperative games with restricted cooperation, various restrictions on coalition formation are studied. The most studied restrictions are those that arise from restricted communication and hierarchies. This survey discusses several models of hierarchy restrictions and their...

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