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 …

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 …

graphs. We study in this perspective the core of games defined on k-regular set systems. We show that the core may be …

The core of a cooperative game on a set of players N is one of the most popular concept of solution. When cooperation … is restricted (feasible coalitions form a subcollection F of 2N), the core may become unbounded, which makes it usage … questionable in practice. Our proposal is to make the core bounded by turning some of the inequalities defining the core into …