A situation in which a finite set of agents can generate certain payoffs by cooperation can be described by a cooperative game with transferable utility (or simply a TU-game) where each agent is represented by one player in the game. In this paper, we assume that one agent can be represented by...

We consider cooperative transferable utility games, or simply TU-games, with a limited communication structure in which players can cooperate if and only if they are connected in the communication graph. A difference between the restricted Banzhaf value and the Myerson value (i.e. the Shapley...

Three well-known solutions for cooperative TU-games are the Shapley value, the Banzhaf value and the equal division solution. In the literature various axiomatizations of these solutions can be found. Axiomatizations of the Shapley value often use efficiency which is not satisfied by the Banzhaf...

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A (single-valued) solution for TU-games assigns a payoff distribution to every TU-game. A well-known solution is the...

Agents participating in different kind of organizations, usually take different positions in some relational structure. The aim of this paper is to introduce a new framework taking into account both communication and hierachical features derived from this participation. In fact, this new set or...

This paper extends the notion of individual minimal rights for a transferable utility game (TU-game) to coalitional minimal rights using minimal balanced families of a specific type, thus defining a corresponding minimal rights game. It is shown that the core of a TU-game coincides with the core...

In this paper, we analyze cost sharing problems arising from a general service by explicitly taking into account the generated revenues. To this cost-revenue sharing problem, we associate a cooperative game with transferable utility, called cost-revenue game. By considering cooperation among the...

This paper describes a classroom experiment that illustrates the research and development investment incentives facing firms when technological spillovers are present. The game involves two stages in which student sellers first make investment decisions then production decisions. The classroom...

We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called component balancedness. This latter axiom compares for every component in the communication graph the total payoff to the players of...

In a standard TU-game it is assumed that every subset of the player set can form a coalition and earn its worth. One of the first models where restrictions in cooperation are considered is the one of games with coalition structure. In such games the player set is partitioned into unions and...