A simple procedure for computing strong constrained egalitarian allocations

This paper deals with the strong constrained egalitarian solution introduced by Dutta and Ray (1991). We show that this solution yields the weak constrained egalitarian allocations (Dutta and Ray, 1989) associated to a finite family of convex games. This relationship makes it possible to define a systematic way of computing the strong constrained egalitarian allocations for any arbitrary game, using the well-known Dutta-Rays algorithm for convex games. We also characterize non-emptiness and show that the set of strong constrained egalitarian allocations Lorenz dominates every other point in the equal division core (Selten, 1972).