The process of computing the nucleolus of arbitrary transferable utility games is notoriously hard. A number of papers have appeared in which the nucleolus is computed by an algorithm in which either one or a huge number of huge linear programs have to be solved. <p>We show that on the class of...</p>

In this paper we define the Lorenz stable set, a subset of the core consisting of the allocations that are not Lorenz dominated by any other allocation of the core. We introduce the leximin stable allocation, which is derived from the application of the Rawlsian criterion on the core. We also...