Showing 71 - 80 of 20,618
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 …
Persistent link: https://www.econbiz.de/10011348360
members of a coalition. We then define a concept of the Core that takes into account these communication possibilities. The …
Persistent link: https://www.econbiz.de/10011504624
We introduce an efficient solution for games with communication graph structures and show that it is characterized by … communication graph the total payoff to the players of this component in the game itself to the total payoff of these players when …
Persistent link: https://www.econbiz.de/10011386146
A new solution is presented for transferable utility games with graph communication where the cooperation possibilities … introduced, under which the value is guaranteed to be an element of the core. For games with complete graph communication the … connected set in the given graph. To determine the payoff for each player, a single-valued solution, the communication tree …
Persistent link: https://www.econbiz.de/10013097263
We study cooperative games with communication structure, represented by an undirected graph. Players in the game are …-convexity is weaker than convexity. For games with a cycle-free communication structure, link-convexity is even weaker than super-additivity … proposed for this class of games. Given the graph structure we define a collection of spanning trees, where each spanning tree …
Persistent link: https://www.econbiz.de/10012723213
We study cooperative games with communication structure, represented by an undirected graph. Players in the game are …-convexity is weaker than convexity. For games with a cycle-free communication structure, link-convexity is even weaker than super-additivity … proposed for this class of games. Given the graph structure we define a collection of spanning trees, where each spanning tree …
Persistent link: https://www.econbiz.de/10012723255
We consider a communications network in which users transmit beneficial information to each other at a cost. We pinpoint conditions under which the induced cooperative game is supermodular (convex). Our analysis is in a lattice-theoretic framework, which is at once simple and able to encompass a...
Persistent link: https://www.econbiz.de/10012779071
networks, such coordination may be very difficult to achieve and may depend on the communication technology and the network … structure. We examine how pre-play communication and clustering within networks affect coordination in a challenging … outcome in our game, but restricted communication (where subjects can only indicate their intended action) is almost entirely …
Persistent link: https://www.econbiz.de/10012866385
networks, such coordination may be very difficult to achieve and may depend on the communication technology and the network … structure. We examine how pre-play communication and clustering within networks affect coordination in a challenging … outcome in our game, but restricted communication (where subjects can only indicate their intended action) is almost entirely …
Persistent link: https://www.econbiz.de/10012870134
networks, such coordination may be very difficult to achieve and may depend on the communication technology and the network … structure. We examine how pre-play communication and clustering within networks affect coordination in a challenging … outcome in our game, but restricted communication (where subjects can only indicate their intended action) is almost entirely …
Persistent link: https://www.econbiz.de/10012870539