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

t is well-known that the prenucleolus on the class of TU games is characterized by singlevaluedness, covariance under strategic equivalence, anonymity, and the reduced game property. We show that the prenucleolus on the class of TU games restricted to the connected coalitions with respect to...