Fairly allocating contiguous blocks of indivisible items

DOI10.1016/J.DAM.2019.01.036MaRDI QIDQ6830040zbMATH OpenFDO

Authors Warut Suksompong

Publication date 3 May 2019

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2019.01.036

zbMATH Keywords

envy-freenessequitabilityfair divisionproportionality

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cited in

(8)

• Welfare loss in connected resource allocation
• Fair and efficient graphical resource allocation with matching-induced utilities
• On the price of fairness of allocating contiguous blocks
• Differentially private fair division
• Achieving envy-freeness through items sale
• A fair allocation is approximately optimal for indivisible chores, or is it?
• Approximating proportional and maximin allocations on d-claw-free graphs
• The complexity of envy-free graph cutting

This page was built for publication: Fairly allocating contiguous blocks of indivisible items

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