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 …

, that is, coalitions for which any solution of the d-core yields a payment for that coalition equal to its worht. In …We consider in this paper solutions for TU-games where it is not assumed that the grand coalition is necessarily the … final state of cooperation. Partitions of the grand coalition, or balanced collections together with a system of balancing …

each coalition, which permits to realize the payoff vector. We give two instances of such solutions, called the d …-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 …

viewed as a general solution, since it implies to give an amount to the grand coalition. The k-additive core being an …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 …

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 …

viewed as a general solution, since it implies to give an amount to the grand coalition. The k-additive core being an … axiomatizations, as well as its relation to the extended core of Bejan and Gomez. We introduce also the notion of unstable coalition …In cooperative games, the core is one of the most popular solution concept since it ensures coalitional rationality …