The component fairness solution for cycle-free graph games

In this paper we study cooperative games with limited cooperation possibilities, represented by an undirected cycle-free communication graph. Players in the game can cooperate if and only if they are connected in the graph, i.e. they can communicate with one another. We introduce a new single-valued solution concept, the component fairness solution. Our solution is characterized by component efficiency and component fairness. The interpretation of component fairness is that deleting a link between two players yields for both resulting components the same average change in payoff, where the average is taken over the players in the component. Component fairness replaces the axiom of fairness characterizing the Myerson value, where the players whose link is deleted face the same loss in payoff. The component fairness solution is always in the core of the restricted game in case the game is superadditive and can be easily computed as the average of n specific marginal vectors, where n is the number of players. We also show that the component fairness solution can be generated by a specific distribution of the Harsanyi-dividends.