A set of necessary and sufficient conditions for convexity of a transferable utility game in terms of its decomposition into unanimity games is shown to be minimal: none of the conditions is redundant. The result is used to provide an axiomatization of the Shapley value on the set of convex games.

A set of necessary and sufficient conditions for convexity of a transferable utility game in terms of its decomposition into unanimity games is shown to be minimal: none of the conditions is redundant. The result is used to provide an axiomatization of the Shapley value on the set of convex games.

A set of necessary and sufficient conditions for convexity of a transferable utility game in terms of its decomposition into unanimity games is shown to be minimal: none of the conditions is redundant. The result is used to provide an axiomatization of the Shapley value on the set of convex games.