Dividing connected chores fairly

DOI10.1016/j.tcs.2015.05.041zbMath1331.91107OpenAlexW1780118416WikidataQ29540237 ScholiaQ29540237MaRDI QIDQ500994

Rob van Stee, Sandy Heydrich

Publication date: 8 October 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.05.041

zbMATH Keywords

cake cuttingprice of fairnessdivision of chores

Mathematics Subject Classification ID

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

Related Items (5)

Truthful fair division without free disposal ⋮ The price of envy-freeness in machine scheduling ⋮ Fairly allocating contiguous blocks of indivisible items ⋮ The price of fairness for indivisible goods ⋮ Allocating contiguous blocks of indivisible chores fairly

Cites Work

• Unnamed Item
• The efficiency of fair division
• On the existence of equitable cake divisions
• Rental Harmony: Sperner's Lemma in Fair Division
• Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games
• 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
• Four-Person Envy-Free Chore Division
• An Envy-Free Cake Division Protocol

This page was built for publication: Dividing connected chores fairly