Recently, applications of cooperative game theory to economic allocation problems have gained popularity. In many of these problems, players are organized according to either a hierarchical structure or a levels structure that restrict players' possibilities to cooperate. In this paper, we...

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

Recently, applications of cooperative game theory to economic allocation problems have gained popularity. In many of these problems, players are organized according to either a hierarchical structure or a levels structure that restrict players ́possibilities to cooperate. 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 (single-valued) solution for TU-games assigns a payoff distribution to every TU-game. A well-known solution is the...

For joint liability problems concerning tort law, a legal compensation scheme may be based on lower and upper bounds of compensation for injury and on case-system consistency. Introducing several properties inspired from this observation, we analyze compensation schemes axiomatically under the...

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

Polluted rivers are harmful to human, animals and plants living along it. To reduce the harm, cleaning costs are generated. However, when the river passes through several different countries or regions, a relevant question is how should the costs be shared among the agents. Ni and Wang (2007)...

Power is a core concept in the analysis and design of organizations. One of the problems with the extant literature on positional power in hierarchies is that it is mainly restricted to the analysis of power in terms of the bare positions of the actors. While such an analysis informs us about...

One of the most famous ranking methods for digraphs is the ranking by Copeland score. The Copeland score of a node in a digraph is the difference between its outdegree (i.e. its number of outgoing arcs) and its indegree (i.e. its number of ingoing arcs). In the ranking by Copeland score, a node...