An axiomatization of the aspiration core
The aspiration core of a TU game was introduced by Bennett  as a payoff vector which is undominated and achievable in the sense that each player belongs to a coalition which can obtain the specified payoff for its members, and which minimizes the distance to the set of aggregate feasible payoffs among all such payoff vectors. In the paper a set of axioms is proposed which characterize the aspiration core, which may be considered as an extension of the core to a much larger set of games. The axioms involve the standard notions of reduced game and converse reduced game although the notions have to be modified to allow for infeasible payoffs. Also, a class of auxiliary games which are not TU games has to be added to the domain of the abstract solution concept considered.