Some characterizations of egalitarian solutions on classes of TU-games

In this paper we derive characterizations of egalitarian solutions on two subclasses of the class of balanced games. Firstly we show that the dutta–ray solution is the only solution that satisfies symmetry, independence of irrelevant core allocations, and continuity on the class of convex games. Secondly, together with the other two requirements, a strengthening of continuity to monotonicity in the value of the grand coalition turns out to be sufficient for the characterization of the lexicographically maximal solution on the class of large core games.