This discussion paper resulted in a publication in the 'Annals of Operations Research' (forthcoming).<P> We introduce an Owen-type value for games with two-level communication structures, being structures where the players are partitioned into a coalition structure such that there exists restricted...</p>

This discussion paper resulted in a publication in 'Economics Letters', 2012, 117, 786-789.<P> 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...</p>

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 fair distribution of the surplus.

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

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

Abstract: We introduce a single-valued solution concept, the so-called average covering tree value, for the class of transferable utility games with limited communication structure represented by a directed graph. The solution is the average of the marginal contribution vectors corresponding to...

Mathematics Subject Classification 2000: 91A12, 91A43

On the class of cycle-free directed graph games with transferable utility solution concepts, called web values, are introduced axiomatically, each one with respect to some specific choice of a management team of the graph. We provide their explicit formula representation and simple recursive...

In this article we study cooperative multi-choice games with limited cooperation possibilities, represented by an undirected forest on the player set. Players in the game can cooperate if they are connected in the forest. We introduce a new (single-valued) solution concept which is a...

In the literature various axiomatizations of the Shapley and Banzhaf value can be found where the only difference is the Shapley value satisfying efficiency and the Banzhaf value satisfying collusion neutrality. Both properties seem to be desirable. In this paper, we show that there is no...