In this article, we generalize the position value, defined by Meessen (1988) for the class of deterministic communication situations, to the class of generalized probabilistic com- munication situations (G ́ Gomez et al. (2008)). We provide two characterizations of this new allocation rule....

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

We survey axiomatic results concerning the Shapley value (Shapley (1953)). This marginalist allocation rule results from an axiomatic study of the class of coalitional games. Shapley (1953) specifies a list of desirable properties of solutions for this class of games, and he shows that the...

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 introduce a new allocation rule, called the sequential equal surplus division for rooted forest TU-games. We provide two axiomatic characterizations for this allocation rule. The first one uses the classical property of component efficiency plus an edge deletion property. The second...

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