We study values for transferable utility games enriched by a communication graph. The most well-known such values are component-efficient and characterized by some link-deletion property. We study efficient extensions of such values: for a given component-efficient value, we look for a value...

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