Abstract

We revisit the characterization of the Shapley value by van den Brink (Int J Game Theory, 2001, 30:309–319) via efficiency, the Null player axiom, and some fairness axiom. In particular, we show that this characterization also works within certain classes of TU games, including the classes of superadditive and of convex games. Further, we advocate some differential version of the marginality axiom (Young, Int J Game Theory, 1985, 14: 65–72), which turns out to be equivalent to the van den Brink fairness axiom on large classes of games.