Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol

DOI10.1137/1.9781611975994.130OpenAlexW2960958928MaRDI QIDQ5146918FDOQ5146918

Author name not available (Why is that?)

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)

Cited In (5)

• A discrete and bounded locally envy-free cake cutting protocol on trees
• Approximate envy-freeness in graphical cake cutting
• A Note on a Cake Cutting Algorithm of Banach and Knaster
• Thou shalt covet the average of thy neighbors' cakes
• Parameterized complexity of envy-free resource allocation in social networks

Recommendations

• Title not available (Why is that?) 👍 👎
• Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm 👍 👎
• Algorithmic Solutions for Envy-Free Cake Cutting 👍 👎
• Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations 👍 👎
• A discrete and bounded envy-free cake cutting protocol for four agents 👍 👎
• Contiguous Cake Cutting: Hardness Results and Approximation Algorithms 👍 👎
• A near equitable 2-person cake cutting algorithm 👍 👎
• A Protocol for Cutting Matroids Like Cakes 👍 👎
• An approximation scheme for cake division with a linear number of cuts 👍 👎

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

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