The Shapley Value and Games with Hierarchies

In this paper we focus on restrictions arising from the players belonging to some hierarchical structure that is represented by a digraph. Two of these models are the games with a permission structure and games under precedence constraints. In both cases, the hierarchy can be represented by a directed graph which restricts the possibilities of coalition formation. These two approaches led to two different type of solutions in the literature. The precedence power solutions for games under precedence constraints, are axiomatized with an axiom that applies a network power measure to the precedence constraint. We will show that something similar can be done for games with a permission structure, and obtain a class of permission power solutions. This class contains the (conjunctive) permission value. With this we have two classes of solutions for games with a hierarchy, one based on permission structures and another based on precedence constraints, that are characterized by similar axioms. Moreover, the solutions are linked with network power measures.