The complexity of computing the Muirhead-Dalton distance

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?"

MoreLess

Year of publication:	2009
Authors:	Deineko, Vladimir G. ; Klinz, Bettina ; Woeginger, Gerhard J.
Published in:	Mathematical Social Sciences. - Elsevier, ISSN 0165-4896. - Vol. 57.2009, 2, p. 282-284
Publisher:	Elsevier
Keywords:	D63 D81 I31 Income inequality Muirhead-Dalton transfer Lorenz-domination Majorization Computational complexity

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005307958