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

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

We consider the problem of sharing water among agents located along a river. Each agent has quasi-linear preferences over river water and money, where the benefit of consuming an amount of water is given by a continuous and concave benefit function. A solution to the problem efficiently...

In the literature various models of games with restricted cooperation can be found. In those models, instead of allowing for all subsets of the set of players to form, it is assumed that the set of feasible coalitions is a proper subset of the power set of the set of players. In this paper we...

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 to every TU-game. In the literature various models of games...

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 (single-valued) solution for TU-games assigns a payoff distribution to every TU-game. A well-known solution is the...

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

Three well-known solutions for cooperative TU-games are the Shapley value, the Banzhaf value and the equal division solution. In the literature various axiomatizations of these solutions can be found. Axiomatizations of the Shapley value often use efficiency which is not satisfied by the Banzhaf...

In this paper we consider the problem of sharing water from a river among a group of agents (countries, cities, firms) located along the river. The benefit of each agent depends on the amount of water consumed by the agent. An allocation of the water among the agents is efficient when it...

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