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