We investigate assignment of heterogeneous agents in trees where the allocation rule is given by the permission value. We focus on efficient hierarchies,namely those, for which the payoff of the top agent is maximized. For additive games, such hierarchies are always cogent, namely, more...

We investigate assignment of heterogeneous agents in trees where the allocation rule is given by the permission value. We focus on efficient hierarchies,namely those, for which the payoff of the top agent is maximized. For additive games, such hierarchies are always cogent, namely, more...