Allocating contiguous blocks of indivisible chores fairly

DOI10.1016/j.ic.2021.104739OpenAlexW3134693426MaRDI QIDQ2051776

Rob van Stee, Felix Höhne

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

social choiceprice of fairnessdivision of choresindivisible itemscontiguous allocations

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Almost envy-free allocations with connected bundles

Cites Work

• Truth, justice, and cake cutting
• Dividing connected chores fairly
• The efficiency of fair division
• Truthful fair division without free disposal
• Fair division of mixed divisible and indivisible goods
• Dividing bads under additive utilities
• On the existence of equitable cake divisions
• Rental Harmony: Sperner's Lemma in Fair Division
• The Price of Fairness
• 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
• Fairly allocating contiguous blocks of indivisible items

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