Deineko, Vladimir G.; Klinz, Bettina; Woeginger, Gerhard J. - In: Mathematical Social Sciences 57 (2009) 2, pp. 282-284
We show that the following problem is NP-hard, and hence computationally intractable: "Given a vector y that Lorenz-dominates a vector x, what is the smallest number of Muirhead-Dalton transfers that transform x into y?"