Showing 31 - 40 of 206
The Myerson's models on partial cooperation in cooperative games have been studied extensively by Borm, Owen, Tijs and Myerson. Hamiache proposes a new solution concept for the case in which the communication relations among players are modelled by means of an undirected graph. In this work, we...
Persistent link: https://www.econbiz.de/10005121296
We study values for transferable utility games enriched by a communication graph. The most well-known such values are component-efficient and characterized by some link-deletion property. We study efficient extensions of such values: for a given component-efficient value, we look for a value...
Persistent link: https://www.econbiz.de/10011196784
AMS classification: 90B18; 91A12; 91A43;
Persistent link: https://www.econbiz.de/10011090586
Abstract: A new solution is presented for transferable utility games with graph communication where the cooperation possibilities are represented by a graph. Players are only able to cooperate and obtain some worth in a coalition if they form a connected set in the given graph. To determine the...
Persistent link: https://www.econbiz.de/10011091726
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
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/10010491412
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
Persistent link: https://www.econbiz.de/10011740076
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/10011256471
Persistent link: https://www.econbiz.de/10012499822