scientific article; zbMATH DE number 4160481

MaRDI QIDQ3487147zbMATH OpenFDO

Authors E. A. Sotnikov

Publication date 1990

zbMATH Keywords

NP-difficult problemsredistribution of indivisible resources

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Computational complexity of the problem of choosing exchange alternatives with a limited number of indivisible resources
• scientific article; zbMATH DE number 1552334
• Computing welfare-maximizing fair allocations of indivisible goods
• Decomposition of uniform resource allocation problems
• scientific article; zbMATH DE number 6004850
• Complexity of finding Pareto-efficient allocations of highest welfare
• Approximation algorithms for computing maximin share allocations
• Approximation Algorithms for Computing Maximin Share Allocations
• On a Reduction for a Class of Resource Allocation Problems
• On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences

Cited in

(5)

• The complexity of computing the Muirhead-Dalton distance
• Computational complexity of the problem of choosing exchange alternatives with a limited number of indivisible resources
• Constrained swap dynamics over a social network in distributed resource reallocation
• scientific article; zbMATH DE number 1552334 (Why is no real title available?)
• Decomposition of uniform resource allocation problems

This page was built for publication:

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