An efficient and fair solution for communication graph games\ud

Abstract

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 payo to the players of this component in the game itself to the total payoff of these players when applying the solution to the subgame induced by this component