having a nonempty core, and this core is usually considered as the solution of game. Based on the concept of k-additivity, we … define to so-called k-balanced games and the corresponding generalization of core, the k-additive core, whose elements are … corresponding k-additive core is not empty. For the games in the k-additive core, we propose a sharing procedure to get an …

An element of the possibly unbounded core of a cooperative game with precedence constraints belongs to its bounded core … if any transfer to a player from any of her subordinates results in payoffs outside the core. The bounded core is the … union of all bounded faces of the core, it is nonempty if the core is nonempty, and it is a continuous correspondence on …

In cooperative games, the core is one of the most popular solution concept since it ensures coalitional rationality …. For non-balanced games however, the core is empty, and other solution concepts have to be found. We propose the use of … particular, the k-additive core proposed by Grabisch and Miranda is a general solution preserving coalitional rationality which …