Showing 1 - 10 of 85
models of communication and hierarchy restrictions in cooperative games, compare different network structures with each other … illustrate these network structures by applying them to cooperative games with restricted cooperation. …
Persistent link: https://www.econbiz.de/10012434059
Nash equilibrium is shown to exist for every game. In symmetric bimatrix games, our results imply the existence of a …
Persistent link: https://www.econbiz.de/10011327822
players ́possibilities to cooperate. In this paper, we propose three new solutions for games with hierarchical structure and … games with levels structure. The transformations that map the set of hierarchical structures to the set of levels structures …
Persistent link: https://www.econbiz.de/10010532576
monotone transferable utility games, discuss other properties of this solution, and deal with its characterization through a …
Persistent link: https://www.econbiz.de/10011372977
cooperative games this trade-off can be framed as one of choosing to allocate according to the Shapley value or the equal division …
Persistent link: https://www.econbiz.de/10011372987
In this paper we introduce an extension of the model of restricted communication in cooperative games as introduced in …
Persistent link: https://www.econbiz.de/10011373812
the 1-nucleolus and the compromise value of exact games coincide. …
Persistent link: https://www.econbiz.de/10011376297
cooperative game with transferable utility, or simply a TU-game. A (single-valued) solution for TU-games assigns a payoff … provide a polynomial time algorithm for computing the nucleolus of the restricted games corresponding to a class of games with …
Persistent link: https://www.econbiz.de/10011376532
We study cooperative games with communication structure, represented by an undirected graph. Players in the game are … proposed for this class of games. Given the graph structure we define a collection of spanning trees, where each spanning tree …-convexity is weaker than convexity. For games with a cycle-free communication structure, link-convexity is even weaker than super-additivity. …
Persistent link: https://www.econbiz.de/10011377055
cooperative game with transferable utility, or simply a TU-game. A (single-valued) solution for TU-games assigns a payoff … consider the class of non-negative additive games with an acyclic permission structure. This class generalizes the so …-called peer group games being non-negative additive games on a permission tree. We provide a polynomial time algorithm for …
Persistent link: https://www.econbiz.de/10011377258