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

to the c-core, while the latter corresponds to the aspiration core or d-core, where in both case, the best configuration …, that is, coalitions for which any solution of the d-core yields a payment for that coalition equal to its worht. In … possible payment (core element) and a single possible configuration. We also introduce the notion of inescapable coalitions …

-multicoalitional core and the c-multicoalitional core, and both arise as the strong Nash equilibrium of two games, where in the first … utility per active unit of time is maximized, while in the second it is the utility per total unit of time. We show that the d-core … (or aspiration core) of Benett, and the c-core of Guesnerie and Oddou are strongly related to the d-multicoalitional and c …

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 …

core (nonemptiness, boundedness, pointedness, extremal rays). …

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 …

generated by a partial order on the set of players. In such a situation, the core may be unbounded, and one has to select a … bounded part of the core as a solution concept. The restricted core is obtained by imposing equality constraints in the core … for sets belonging to so-called normal collections, resulting (if nonempty) in the selection of a bounded face of the core …

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 …

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 …