Narrow search
Showing 1 - 7 of 7
Cover Image
Cooperative Games in Graph Structure
Herings, P. Jean-Jacques; van der Laan, Gerard; Talman, Dolf - 2000
determinedthat depends on the relative positions of the players within the graph.A collection of graphs will be called balanced if to … the core andthe payoff vector is an element of payoff sets of all graphs in some balanced collection ofgraphs. We prove …
Persistent link: https://www.econbiz.de/10010324576
Cover Image
Two Values for Transferable Utility Games with Coalition and Graph Structure
van den Brink, Rene; van der Laan, Gerard; Moes, Nigel - 2011
In this paper we introduce and characterize two new values for transferable utility games with graph restricted communication and a priori unions. Both values are obtained by applying the Shapley value to an associated TU-game. The graph-partition restricted TU-game is obtained by taking the...
Persistent link: https://www.econbiz.de/10010326357
Cover Image
Cooperative games in graph structure
Herings, Peter Jean-Jacques; Laan, Gerard van der; … - 2000
determinedthat depends on the relative positions of the players within the graph. A collection of graphs will be called balanced if … lies in the core andthe payoff vector is an element of payoff sets of all graphs in some balanced collection ofgraphs. We …
Persistent link: https://www.econbiz.de/10011303860
Cover Image
Two Values for Transferable Utility Games with Coalition and Graph Structure
Brink, Rene van den; Laan, Gerard van der; Moes, Nigel - Tinbergen Instituut - 2011
This discussion paper led to a publication in 'TOP' (forthcoming).<P> In this paper we introduce and characterize two new values for transferable utility games with graph restricted communication and a priori unions. Both values are obtained by applying the Shapley value to an associated TU-game....</p>
Persistent link: https://www.econbiz.de/10011255446
Cover Image
Cooperative Games in Graph Structure
Herings, P. Jean-Jacques; Laan, Gerard van der; Talman, Dolf - Tinbergen Instituut - 2000
determinedthat depends on the relative positions of the players within the graph.A collection of graphs will be called balanced if to … the core andthe payoff vector is an element of payoff sets of all graphs in some balanced collection ofgraphs. We prove …
Persistent link: https://www.econbiz.de/10011255644
Cover Image
Cooperative Games in Graph Structure
Herings, P. Jean-Jacques; Laan, Gerard van der; Talman, Dolf - Tinbergen Institute - 2000
that depends on the relative positions of the players within the graph. A collection of graphs will be called balanced if … lies in the core and the payoff vector is an element of payoff sets of all graphs in some balanced collection of graphs. We …
Persistent link: https://www.econbiz.de/10005281869
Cover Image
Cooperative Games in Graph Structure
Talman, Dolf; Herings, P.J.J.; van der Laan, G. - Tilburg University, Center for Economic Research - 2000
players within the graph.A collection of graphs will be called balanced if to any graph in the collection a positive weight …-core if it lies in the core and the payoff vector is an element of payoff sets of all graphs in some balanced collection of … graphs.We prove that any balanced graph game has a nonempty balanced-core and therefore a nonempty core.We conclude by some …
Persistent link: https://www.econbiz.de/10011091897