Some characterizations of egalitarian solutions on classes of TU-games. (Q1421927)

First, the authors study core solutions defined on the class of convex TU games. It is shown that the Dutta-Ray (or egalitarian here) solution is the only core solution on this class that satisfies the axioms of (i) independence of irrelevant core allocations, (ii) symmetry, and (iii) continuity. The second part of the paper deals with a particular egalitarian solution: the lexicographically maximal solution (Lmax) on the class of large core games. It is proved that Lmax is the only core solution defined on this class to satisfy the axioms of (i) independence of irrelevant core allocations, (ii) symmetry, and (iv) aggregate monotonicity. A procedure to compute Lmax is also given.