Showing 1 - 8 of 8
There lies a network structure between fixed tree and minimum cost spanning tree networks that has not been previously analyzed from a cooperative game theoretic perspective, namely, directed acyclic graph (DAG) networks. In this paper we consider the cost allocation game defined on...
Persistent link: https://www.econbiz.de/10010941768
We provide a new modus operandi for the computation of the nucleolus in cooperative games with transferable utility. Using the concept of dual game we extend the theory of characterization sets. Dually essential and dually saturated coalitions determine both the core and the nucleolus in...
Persistent link: https://www.econbiz.de/10011444391
In this paper we consider a natural generalization of standard tree games where the underlying structure is a directed acyclic graph. We analyze the properties of the game and illustrate its relation with other graph based cost games. We show that although the game is not convex its core is...
Persistent link: https://www.econbiz.de/10010494560
There lies a network structure between fixed tree and minimum cost spanning tree networks that has not been previously analyzed from a cooperative game theoretic perspective, namely, directed acyclic graph (DAG) networks. In this paper we consider the cost allocation game defined on...
Persistent link: https://www.econbiz.de/10010494580
Persistent link: https://www.econbiz.de/10011535401
We provide a new modus operandi for the computation of the nucleolus in cooperative games with transferable utility. Using the concept of dual game we extend the theory of characterization sets. Dually essential and dually saturated coalitions determine both the core and the nucleolus in...
Persistent link: https://www.econbiz.de/10010481785
In this paper we consider a natural generalization of standard tree games where the underlying structure is a directed acyclic graph. We analyze the properties of the game and illustrate its relation with other graph based cost games. We show that although the game is not convex its core is...
Persistent link: https://www.econbiz.de/10009773083
In this paper we consider a natural generalization of standard tree games where the underlying network is a directed acyclic graph. We briefly discuss the relation of directed acyclic graph (DAG) games with other network-based cost games. We show that in general a DAG-game is not concave, even...
Persistent link: https://www.econbiz.de/10010388613