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

The core of a game v on N, which is the set of additive games φ dominating v such that φ(N)=v(N), is a central notion … and the greedy algorithm. In many cases however, the core is empty, and alternative solutions have to be found. We define … the k-additive core by replacing additive games by k-additive games in the definition of the core, where k-additive games …

modelled in terms of equilibrium-core allocations of parameterized cost games. …

allocation of resource and compensations among generations. Fairness is defined by core lower bounds and aspiration upper bounds …. The core lower bounds require that every coalition of generations obtains at least what it could achieve by itself. The …

Finding a solution concept is one of the central problems in cooperative game theory, and the notion of core is the … core, reflecting the team structure, and previous attempts are not satisfactory in this respect. We propose a new notion of … core, which imposes efficiency of the allocation at each level of the hierarchy, and answers the problem of sharing …