Thou shalt covet the average of thy neighbors' cakes

DOI10.1016/J.IPL.2022.106341OpenAlexW3175502624MaRDI QIDQ2680239FDOQ2680239

Authors: Jamie Tucker-Foltz 

Publication date: 30 January 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.11178

zbMATH Keywords

computational complexityquery complexityfair divisioncake-cuttinglocal proportionality

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• Balls and bins: A study in negative dependence
• Title not available (Why is that?)
• Cake cutting really is not a piece of cake
• A note on cake cutting
• Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol

Cited In (2)

• A discrete and bounded locally envy-free cake cutting protocol on trees
• Approximate envy-freeness in graphical cake cutting

This page was built for publication: Thou shalt covet the average of thy neighbors' cakes

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