Allocating contiguous blocks of indivisible chores fairly

DOI10.1016/J.IC.2021.104739MaRDI QIDQ2051776zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

contiguous allocationsdivision of choresindivisible itemsprice of fairnesssocial choice

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

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

Cites work

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

Cited in

(7)

• Almost envy-free allocations with connected bundles
• How to allocate hard candies fairly
• Dividing connected chores fairly
• Dividing connected chores fairly
• Almost proportional allocations of indivisible chores: computation, approximation and efficiency
• On the price of fairness of allocating contiguous blocks
• A fair allocation is approximately optimal for indivisible chores, or is it?

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)