We show that neither Peleg's nor Tadenuma's well-known axiomatizations of the core by non-emptiness, individual rationality, super-additivity, and max consistency or complement consistency, respectively, hold when only convex rather than balanced TU games are considered, even if anonymity is...

This paper formally introduces Hart-Mas-Colell consistency for general (possibly multi-valued) solutions for cooperative games with transferable utility. This notion is used to axiomatically characterize the core on the domain of convex games. Moreover, we characterize all nonempty solutions...

A balanced transferable utility game (N, v) has a stable core if its core is externally stable, that is, if each imputation that is not in the core is dominated by some core element. Given two payoff allocations x and y, we say that x outvotes y via some coalition S of a feasible set if x...

We show that the constrained egalitarian surplus-sharing rule, which divides the surplus so that the poorer players' resulting payoffs become equal but not larger than any remaining player's status quo payoff, is characterized by Pareto optimality, path independence, both well-known, and less...

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 on the domain of convex games, Dutta-Ray's egalitarian solution is characterized by core selection, aggregate monotonicity, and bounded richness, a new property requiring that the poorest players cannot be made richer within the core. Replacing "poorest" by "poorer" allows to...

It is known that for supermodular TU-games, the vertices of the core are the marginal vectors, and this result remains true for games where the set of feasible coalitions is a distributive lattice. Such games are induced by a hierarchy (partial order) on players. We propose a larger class of...

We explore the relationship between non-manipulability via merging (splitting) and strong non-manipulability via merging (splitting). We show that although, in general, these non-manipulability properties are not equivalent, under the principle of solidarity, fulfilled by a wide range of...

We generalize the characterizations of the positive core and the positive prekernel to TU games with precedence constraints and show that the positive core is characterized by non-emptiness (NE), boundedness (BOUND), covariance under strategic equivalence, closedness (CLOS), the reduced game...

It is well-known that the core on several domains of cooperative transferable utility (TU) and nontransferable utility (NTU) games is characterized by various combinations of axioms containing some versions of the reduced game property, of its converse, or of the reconfirmation property with...