scientific article; zbMATH DE number 4160481

zbMATH Open0706.90063MaRDI QIDQ3487147FDOQ3487147

Authors: E. A. Sotnikov 

Publication date: 1990

Title of this publication is not available (Why is that?)

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
• 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

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)

Cited In (5)

• Title not available (Why is that?)
• The complexity of computing the Muirhead-Dalton distance
• Computational complexity of the problem of choosing exchange alternatives with a limited number of indivisible resources
• Decomposition of uniform resource allocation problems
• Constrained swap dynamics over a social network in distributed resource reallocation

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)