We show that the Aumann-Davis-Maschler bargaining set and the Mas-Colell bargaining set of a non-leveled NTU game that is either ordinal convex or coalition merge convex coincides with the core of the game. Moreover, we show by means of an example that the foregoing statement may not be valid if...

We show that the Aumann-Davis-Maschler bargaining set and the Mas-Colell bargaining set of a non-leveled NTU game that is either ordinal convex or coalition merge convex coincides with the core of the game. Moreover, we show by means of an example that the foregoing statement may not be valid if...

An outcome of a game is partnered if there are no asymmetric dependencies between any two players. For a cooperative game, a payoff is in the partnered core of the game if it is partnered, feasible and cannot be improved upon by any coalition of players. We show that the relative interior of the...

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.

We study the model of link formation that was introduced by Aumann and Myerson (1988) and focus on symmetric convex games with transferable utilities. We show that with at most five players the full cooperation structure results according to a subgame perfect Nash equilibrium.Moreover, if the...