Consistency, Anonymity, and the Core on the Domain of Convex Games

Abstract

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 required in addition. Moreover, we show that the core and its relative interior are only two solutions that satisfy Peleg's axioms together with anonymity and converse max consistency on the domain of convex games.

Keywords: convex TU game, core

JEL Classification: C71