An efficient and fair solution for communication graph games

► We introduce an efficient value for communication graph games. ► We introduce a new axiom called fair distribution of the surplus. ► We axiomatize the new solution using this axiom.