We study values for transferable utility games enriched by a communication graph (CO-games) where the graph does not necessarily a¤ect the productivity but can in?uence the way the players distribute the worth generated by the grand coalition. Thus, we can envisage values that are efficient...

TU games with two-level communication structure, in which a two-level communication structure relates fundamentally to the given coalition structure and consists of a communication graph on the collection of the a priori unions in the coalition structure, as well as a collection of communication...

We study values for transferable utility games enriched by a communication graph. The most well-known such values are component-efficient and characterized by some link-deletion property. We study efficient extensions of such values: for a given component-efficient value, we look for a value...

This article studies values for cooperative games with transferable utility. Numerous such values can be characterized by axioms of associated consistency, which require that a value is invariant under some parametrized linear transformation on the vector space of cooperative games with...

A new class of allocation rules combining marginalistic and egalitarian principles is introduced for cooperative TU-games. It includes some modes of solidarity among the players by taking the collective contribution of some coalitions to the grand coalition into account. Relationships with other...

We consider the problem of sharing water from a river among the group of countries located along it. The benefit of each country depends on the amount of water it consumes. An allocation of the water is efficient when it maximizes the total benefits of the countries. The problem of finding a...

Article 30 of Regulation (EC) No 1907/2006 concerns the sharing of data between users of a chemical substance. We study this bargaining problem by means of a special class of games in coalitional form called data games (Dehez and Tellone, 2013). For such problems, compensation schemes specify...

In Béal et al. (2013) two new axioms of invariance, called Addition invariance and Transfer invariance respectively, are introduced to design allocation rules for TU-games. Here, we derive direct sum decompositions of the linear space of TU-games by using the TU-games selected to construct the...

If a player is removed from a game, what keeps the payoff of the remaining players unchanged? Is it the removal of a special player or its presence among the remaining players? This article answers this question in a complement study to Kamijo and Kongo (2012). We introduce axioms of invariance...

We introduce new axioms for the class of all TU-games with a fixed but arbitrary player set, which require either invariance of an allocation rule or invariance of the payoff assigned by an allocation rule to a specified subset of players in two related TU-games. Comparisons with other axioms...