Allocating contiguous blocks of indivisible chores fairly

DOI10.1016/J.IC.2021.104739OpenAlexW3134693426MaRDI QIDQ2051776FDOQ2051776

Authors: Felix Höhne, Rob van Stee 

Publication date: 25 November 2021

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2021.104739

Recommendations

• Dividing connected chores fairly
• Dividing connected chores fairly
• Fair and efficient cake division with connected pieces

zbMATH Keywords

social choiceprice of fairnessdivision of choresindivisible itemscontiguous allocations

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• The price of fairness
• Rental Harmony: Sperner's Lemma in Fair Division
• Truth, justice, and cake cutting
• How to Cut A Cake Fairly
• How to Cut a Cake Fairly
• A moving-knife solution to the four-person envy-free cake-division problem
• An Envy-Free Cake Division Protocol
• The efficiency of fair division
• Fair division of mixed divisible and indivisible goods
• On the existence of equitable cake divisions
• Dividing connected chores fairly
• Truthful fair division without free disposal
• Dividing bads under additive utilities

Cited In (5)

• Almost proportional allocations of indivisible chores: computation, approximation and efficiency
• How to allocate hard candies fairly
• Dividing connected chores fairly
• Dividing connected chores fairly
• Almost envy-free allocations with connected bundles

This page was built for publication: Allocating contiguous blocks of indivisible chores fairly

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