Socially Acceptable Values for Cooperative TU Games

In the framework of the solution theory for cooperative transferable utility games, a value is called socially acceptable with reference to a certain basis of games if, for each relevant game, the payoff to any productive player covers the payoff to any non-productive player. Firstly, it is shown that two properties called desirability and monotonicity are sufficient to guarantee social acceptability of type $I$. Secondly, the main goal is to investigate and characterize the subclass of efficient, linear, and symmetric values that are socially acceptable for any of three types (with clear affinities to simple unanimity games).