Nash equilibrium is shown to exist for every game. In symmetric bimatrix games, our results imply the existence of a …

properness and a robust Nash equilibrium is shown to exist for every game. In symmetric bimatrix games, our results imply the …

new values for transferable utility games with graph restricted communication and a priori unions. Both values are …

This discussion paper resulted in a publication in 'Games and Economic Behavior', 2010, 68, 626-633. <P> We study … cooperative games with communication structure, represented by an undirected graph. Players in the game are able to cooperate only … of games. Given the graph structure we define a collection of spanning trees, where each spanning tree specifies a …

transferable utility, or simply a TU-game. A solution for TU-games assigns a set of payoff distributions (possibly empty or … this paper we consider games with limited communication structure in which the edges or links of an undirected graph on the … they are connected. For such games we discuss Harsanyi solutions whose dividend shares are based on power measures for …

the player set that is represented by a digraph. We consider games under precedence constraints introduced by Faigle and … Kern (1992) who also introduce a generalization of the Shapley value for such games. They characterized this solution by … efficiency, linearity, the null player property and hierarchical strength which states that in unanimity games the payoffs are …

an Owen-type value for games with two-level communication structures, being structures where the players are partitioned …-Dreze value for games with coalition structures, the Myerson value for communication graph games and the equal surplus division …

In this paper we introduce an extension of the model of restricted communication in cooperative games as introduced in …

cooperative games this trade-off can be framed as one of choosing to allocate according to the Shapley value or the equal division …