scientific article; zbMATH DE number 4160481
From MaRDI portal
Publication:3487147
zbMATH Open0706.90063MaRDI QIDQ3487147FDOQ3487147
Publication date: 1990
Title of this publication is not available (Why is that?)
Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (3)
Recommendations
- Computational complexity of the problem of choosing exchange alternatives with a limited number of indivisible resources π π
- Title not available (Why is that?) π π
- Computing welfare-maximizing fair allocations of indivisible goods π π
- Decomposition of uniform resource allocation problems π π
- Title not available (Why is that?) π π
- 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 π π
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)