We generalize the null player property (satisfied by the Shapley value) and nullifying player property (satisfied by the equal division solution) to the so-called delta-reducing player property, stating that a delta-reducing player (being a player such that any coalition containing this player...

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

Generalized characteristic functions extend characteristic functions of 'classical' TU-games by assigning a real number to every ordered coalition being a permutation of any subset of the player set. Such generalized characteristic functions can be applied when the earnings or costs of...

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

In this paper, we connect the social network theory on centrality measures to the economic theory of preferences and utility. Using the fact that networks form a special class of cooperative TU-games, we provide a foundation for the degree measure as a von Neumann-Morgenstern expected utility...

Standard solutions for TU-games assign to every TU-game a payoff vector. However, if there is uncertainty about the payoff allocation then we cannot just assign a specific payoff to every player. Therefore, in this paper we introduce interval solutions for TU-games which assign to every TU-game...

Agents participating in different kind of organizations, usually take different positions in some network structure. Two well-known network structures are hierarchies and communication networks. We give an overview of the most common models of communication and hierarchy restrictions in...

We investigate Gately's solution concept for cooperative games with transferable utilities. Gately's conception is a bargaining solution and minimises the maximal quantified 'propensity to disrupt' the negotiation of the players over the allocation of the generated collective payoffs. Gately's...