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

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

A single proposer has the opportunity to generate a surplus by taking the assets of a group of individuals. These individuals are called upon to vote for accepting or rejecting the monetary offer made to them by the proposer, who needs the agreement of a qualified majority. The voters who...

We replace the axiom of fairness used in the characterization of the Myerson value (Myerson, 1977) by fairness for neighbors in order to characterize the component-wise egalitarian solution. When a link is broken, fairness states that the two players incident to the link should be affected...

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

This article addresses the question of data-sharing mechanisms under REACH. The members of an information exchange forum have to share their data. This exchange requires the adoption of a compensation scheme : the owner of a data receives a monetary compensation in return for the access to...

This article shows that, for any transferable utility game in coalitional form with nonempty coalition structure core, the number of steps required to switch from a payoff configuration out of the coalition structure core to a payoff configuration in the coalition structure core is less than or...

We consider an alternative expression of the Shapley value that reveals a system of compensations: each player receives an equal share of the worth of each coalition he belongs to, and has to compensate an equal share of the worth of any coalition he does not belong to. We give an interpretation...

We study one aspect of the rationality of players in repeated games. The central assumption is that player?'s choice is limited to strategies that can be computed by a model of computation (or machine). We investigate two of such models : the finite automaton and the perceptron. Each model of...