Efficient extensions of the Myerson value

We study values for transferable utility games enriched by a communication graph (CO-games) where the graph does not necessarily affect the productivity but can influence the way the players distribute the worth generated by the grand coalition. Thus, we can envisage values that are efficient instead of values that are component efficient. For CO-games with connected graphs, efficiency and component efficiency coincide. In particular, the Myerson value (Myerson in Math Oper Res 2:22–229, 1977) is efficient for such games. Moreover, fairness is characteristic of the Myerson value. We identify the value that is efficient for all CO-games, coincides with the Myerson value for CO-games with connected graphs, and satisfies fairness.