Graph monotonic values

摘要

A disturbing feature of most of the solution concepts for TU games with incomplete communication is that payments of players may decrease when they activate a new link. That can be considered as a drawback which does not occur for the Myerson value (Math Oper Res 2:225–229, 1977) of superadditive games. The present article offers a new axiomatic characterization of the Myerson value. We show that the Myerson value is the unique solution for games with communication structures verifying a set of properties including monotonicity with respect to the graph and coinciding with the Shapley value when the communication is complete.