![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Open AccessDirected communication in games with directed graphs
We introduce a novel concept of directed communication and a related connectedness in directed graphs, and apply this to model certain cooperation restrictions in cooperative games. In the literature on commun...
-
Article
Open AccessMarginality and the position value
We present a new characterization of the position value, one of the most prominent allocation rules for communication situations (graph-games or games with restricted communication). This characterization incl...
-
Article
A value for communication situations with players having different bargaining abilities
The aim of this paper is to extend the Myerson value (Myerson in Math Oper Res 2:225–229, 1977) to situations in which players in a TU-game, in addition to having cooperation possibilities restricted by a grap...
-
Article
Players indifferent to cooperate and characterizations of the Shapley value
In this paper we provide new axiomatizations of the Shapley value for TU-games using axioms that are based on relational aspects in the interactions among players. Some of these relational aspects, in particul...
-
Article
A probabilistic position value
In this article, we generalize the position value, defined by Meessen (Master’s thesis, 1988) for the class of deterministic communication situations, to the class of generalized probabilistic communication situa...
-
Article
Splitting graphs when calculating Myerson value for pure overhead games
A communication situation consists of a coalitional game and a graph, the nodes of the graph corresponding to the players of the game. To calculate the Myerson value for such situations, we obtain results whic...