The complexity of computing the Muirhead-Dalton distance

DOI10.1016/j.mathsocsci.2008.11.005zbMath1158.90425OpenAlexW2080119641MaRDI QIDQ1013525

Bettina Klinz, Gerhard J. Woeginger, Vladimir G. Deǐneko

Publication date: 20 April 2009

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2008.11.005

zbMATH Keywords

computational complexityincome inequalitymajorizationLorenz-dominationMuirhead-Dalton transfer

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60)

Related Items (2)

Stochastic Dominance Relations for Integer Variables ⋮ Stochastic dominance relations for integer variables

Cites Work

• Refinements of Muirhead's lemma and income inequality
• Inequalities: theory of majorization and its applications
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of computing the Muirhead-Dalton distance