The complexity of computing the Muirhead-Dalton distance

DOI10.1016/J.MATHSOCSCI.2008.11.005MaRDI QIDQ1013525zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• On the dimension of simple monotonic games
• scientific article; zbMATH DE number 4160481
• On the complexity of purely complex μ computation and related problems in multidimensional systems
• Discrete Optimal Transport with Independent Marginals is #P-Hard
• Hardness results for multimarginal optimal transport problems

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Inequalities: theory of majorization and its applications
• Refinements of Muirhead's lemma and income inequality

Cited in

(6)

• On the complexity of computing the Hausdorff distance
• scientific article; zbMATH DE number 6026956 (Why is no real title available?)
• Stochastic dominance relations for integer variables
• An algorithm for the computation of the Hutchinson distance
• Stochastic Dominance Relations for Integer Variables
• Computing the Monge-Kantorovich distance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013525)