Axiomatic characterizations of the core without consistency

A TU game is totally positive if it is a linear combination of unanimity games with nonnegative coefficients. We show that the core on each cone of convex games that contains the set of totally positive games is characterized by the traditional properties Pareto efficiency, additivity (ADD), individual rationality, and the null-player property together with one new property, called unanimity requiring that the solution, when applied to a unanimity gameon an arbitrary coalition, allows to distribute the entire available amount of money to each player of this coalition. We also show that the foregoing characterization can be generalized to the domain of balanced games by replacing ADD by “ADD on the set of totally positive games plus super-additivity (SUPA) in general”. Adding converse SUPA allows to characterize the core on arbitrary domains of TU games that contain the set of all totallypositive games. Converse SUPA requires a vector to be a member of the solution to a game whenever, when adding a totally positive game such that the sum becomes totally additive, the sum of the vector and each solution element of the totally positive game belongs to the solution of the aggregate game. Unlike in traditional characterizations of the core, our results do not use consistency properties