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...

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...

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...

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...

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...

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...

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...

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...

The group identification literature mostly revolves around the problem of identifying individuals in the community who belong to groups with ethnic or religious identity. Here we use the same model framework to identify individuals who play key role in some sense. In particular we will focus on...

Permutation games are totally balanced transferable utility cooperative games arising from certain sequencing and re-assignment optimization problems. It is known that for permutation games the bargaining set and the core coincide, consequently, the kernel is a subset of the core. We prove that...