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

We study the solution concepts of partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria. The partial cooperative Cournot-Nash equilibrium is axiomatically characterized by using notions of rationality, consistency and converse consistency with regard to...

We provide a generalization of the position value (Meessen 1988) that allows players to benefit from transfers of worth by investing in their communication links. The player who invests the most in a communication link obtains a compensation from the second one. We characterize this new...