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 …

In cooperative games, the core is the most popular solution concept, and its properties are well known. In the … subcollection of the power set of the set of players has many implications on the mathematical structure of the core, depending on …

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

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 …

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 …