In this paper we introduce two values for cooperative games with communication graph structure. For cooperative games the shapley value distributes the worth of the grand coalition amongst the players by taking into account the worths that can be obtained by any coalition of players, but does...

In this paper we introduce two values for cooperative games with communication graph structure. For cooperative games the shapley value distributes the worth of the grand coalition amongst the players by taking into account the worths that can be obtained by any coalition of players, but does...

We introduce cooperative TU-games on concept lattices, where a concept is a pair (S,S') with S being a subset of players or objects, and S' a subset of attributes. Any such game induces a game on the set of players/objects, which appears to be a TU-game whose collection of feasible coalitions is...

We generalize the characterizations of the positive core and the positive prekernel to TU games with precedence constraints and show that the positive core is characterized by non-emptiness (NE), boundedness (BOUND), covariance under strategic equivalence, closedness (CLOS), the reduced game...

We generalize the characterizations of the positive core and the positive prekernel to TU games with precedence constraints and show that the positive core is characterized by non-emptiness (NE), boundedness (BOUND), covariance under strategic equivalence, closedness (CLOS), the reduced game...

We generalize the characterizations of the positive core and the positive prekernel to TU games with precedence constraints and show that the positive core is characterized by non-emptiness (NE), boundedness (BOUND), covariance under strategic equivalence, closedness (CLOS), the reduced game...