Showing 1 - 10 of 39
In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cycle-free communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate with one another. We introduce a new...
Persistent link: https://www.econbiz.de/10011348360
In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cycle-free communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate with one another. We introduce a new...
Persistent link: https://www.econbiz.de/10010325416
In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cycle-free communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate with one another. We introduce a new...
Persistent link: https://www.econbiz.de/10005137217
In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cycle-free communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate with one another. We introduce a new...
Persistent link: https://www.econbiz.de/10011256394
Persistent link: https://www.econbiz.de/10008907852
A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A solution for TU-games assigns a set of payoff distributions (possibly empty or consisting of a unique element) to every...
Persistent link: https://www.econbiz.de/10011338005
There is an extensive literature that studies situations of restricted cooperation in cooperative games. Myerson (1979) introduced communication graph games, where players can only cooperate if they are connected in an undirected graph representing the communication possibilities. The Myerson...
Persistent link: https://www.econbiz.de/10010477095
We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called component balancedness. This latter axiom compares for every component in the communication graph the total payoff to the players of...
Persistent link: https://www.econbiz.de/10011386146
Persistent link: https://www.econbiz.de/10010190658
Persistent link: https://www.econbiz.de/10011740076