Dividing splittable goods evenly and with limited fragmentation

DOI10.4230/LIPICS.MFCS.2017.9MaRDI QIDQ5111223zbMATH OpenOpenAlexFDO

Authors Peter Damaschke

Publication date 26 May 2020

Full work available at URL https://doi.org/10.4230/LIPIcs.MFCS.2017.9

zbMATH Keywords

load balancingpackingweighted graphlinear-time algorithmparameterized algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Searching and sorting (68P10) Approximation algorithms (68W25) Signed and weighted graphs (05C22) Parameterized complexity, tractability and kernelization (68Q27)

Recommendations

• Dividing splittable goods evenly and with limited fragmentation
• Equitable allocation of divisible goods
• Fair division of mixed divisible and indivisible goods
• Fair division of indivisible items
• Fair Allocation of Indivisible Goods
• Efficient Fair Division with Minimal Sharing
• On fair division for indivisible items
• Fair division of indivisible items among people with similar preferences

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• The proper relaxation and the proper gap of the skiving stock problem
• Time bounds for selection

Cited in

(2)

• Dividing splittable goods evenly and with limited fragmentation
• Buying several indivisible goods

This page was built for publication: Dividing splittable goods evenly and with limited fragmentation

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