We provide a generalization of the position value (Meessen 1988) that allows players to benefit from transfers of worth by investing in communication links. The player who invests the most in a communication link obtains transfers of worth from the second one. We characterize this new allocation rule on the class of cycle free graphs by means of four axioms. The first two axioms, component efficiency and superfluous link property, are used to characterize the position value (Meessen (1988), Borm, Owen, and Tijs (1992)). Quasi-additivity is a weak version of the standard additivity axiom. The weighting axiom captures the fact that the allocation of players should be increasing with their level of investment
In this paper, we define a family of values for directed communication situations that are inspired ...
We reconsider the Myerson value and the position value for communication situations. In case the und...
We introduce an efficient solution for games with communication graph structures and show that it is...
We provide a generalization of the position value (Meessen 1988) that allows players to benefit from...
In this article, we generalize the position value, defined by Meessen (1988) for the class of determ...
We present a new characterization of the position value, one of the most prominent allocation rules ...
We study values for transferable utility games enriched by a communication graph. The most well-know...
A network is a graph where the nodes represent players and the links represent bilateral interaction...
A network is a graph where the nodes represent players and the links represent bilateral interaction...
A network is a graph where the nodes represent players and the links represent bilateral interaction...
We propose an allocation rule that takes into account the importance of players and their links and ...
Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly ta...
We study values for transferable utility games enriched by a communication graph (CO-games) where th...
In this paper, we define a family of values for directed communication situations that are inspired ...
We reconsider the Myerson value and the position value for communication situations. In case the und...
We introduce an efficient solution for games with communication graph structures and show that it is...
We provide a generalization of the position value (Meessen 1988) that allows players to benefit from...
In this article, we generalize the position value, defined by Meessen (1988) for the class of determ...
We present a new characterization of the position value, one of the most prominent allocation rules ...
We study values for transferable utility games enriched by a communication graph. The most well-know...
A network is a graph where the nodes represent players and the links represent bilateral interaction...
A network is a graph where the nodes represent players and the links represent bilateral interaction...
A network is a graph where the nodes represent players and the links represent bilateral interaction...
We propose an allocation rule that takes into account the importance of players and their links and ...
Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly ta...
We study values for transferable utility games enriched by a communication graph (CO-games) where th...
In this paper, we define a family of values for directed communication situations that are inspired ...
We reconsider the Myerson value and the position value for communication situations. In case the und...
We introduce an efficient solution for games with communication graph structures and show that it is...