The complexity of computing the Muirhead-Dalton distance

Vladimir G. Deineko, Bettina Klinz and Gerhard J. Woeginger

Mathematical Social Sciences, 2009, vol. 57, issue 2, 282-284

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

Keywords: D63; D81; I31; Income; inequality; Muirhead-Dalton; transfer; Lorenz-domination; Majorization; Computational; complexity (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165-4896(08)00111-X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:57:y:2009:i:2:p:282-284

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().