, with respect to the leader’s choice, of the Shapley value function and the core correspondence of the TU-game is …

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 …

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 …

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 …

-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 …

Given a capacity, the set of dominating k-additive capacities is a convex polytope called the k-additive monotone core … vertices of the n-additive monotone core and we explore the possible translations for the k-additive case. …

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 …

distributive lattice, hence generated by a partial order on the set of players. Its core may be unbounded, and the bounded core …, which is the union of all bounded faces of the core, proves to be a useful solution concept in the framework of games with … precedence constraints. Replacing the inequalities that define the core by equations for a collection of coalitions results in a …

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 …