Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol

DOI10.1137/1.9781611975994.130OpenAlexW2960958928MaRDI QIDQ5146918

No author found.

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Thou shalt covet the average of thy neighbors' cakes ⋮ Parameterized complexity of envy-free resource allocation in social networks

This page was built for publication: Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol