scientific article
From MaRDI portal
Publication:3487147
zbMATH Open0706.90063MaRDI QIDQ3487147
Publication date: 1990
Title of this publication is not available (Why is that?)
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (1)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Computational complexity of the problem of choosing exchange alternatives with a limited number of indivisible resources 👍 👎
- Decomposition of uniform resource allocation problems 👍 👎
- Complexity of finding Pareto-efficient allocations of highest welfare 👍 👎
- Approximation Algorithms for Computing Maximin Share Allocations 👍 👎
- On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences 👍 👎
- Approximation Algorithms for Computing Maximin Share Allocations 👍 👎
- On a Reduction for a Class of Resource Allocation Problems 👍 👎
- Computing welfare-maximizing fair allocations of indivisible goods 👍 👎
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)
