Showing 1 - 10 of 66
In this note, we give a straightforward and elementary proof of a theorem by Aumann and Maschler stating that in the well-known bankruptcy problem, the so-called CG-consistent solution described by the Talmud represents the nucleolus of the corresponding coalitional game. The proof nicely fits...
Persistent link: https://www.econbiz.de/10011011326
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 offer a new approach to the well-known bankruptcy problem based on Kaminski's idea. With the help of hydraulic rationing we give a proof to Aumann and Maschlers theorem i.e. the consistent solution of a bankruptcy problem is the nucleolus of the corresponding game. We use a system of vessels...
Persistent link: https://www.econbiz.de/10010494472
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
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
Persistent link: https://www.econbiz.de/10009674857
Persistent link: https://www.econbiz.de/10001802724
Persistent link: https://www.econbiz.de/10011943703