A note on envy-free cake cutting with polynomial valuations

DOI10.1016/j.ipl.2014.07.005zbMath1302.68307OpenAlexW2122453448MaRDI QIDQ477590

Simina Brânzei

Publication date: 9 December 2014

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.07.005

zbMATH Keywords

algorithmsquery complexitycake cuttingenvy-freeness

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

Three Persons, Two Cuts: A New Cake-Cutting Algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of cake cutting
• How to Cut a Cake Fairly
• An Envy-Free Cake Division Protocol
• Cake cutting really is not a piece of cake

This page was built for publication: A note on envy-free cake cutting with polynomial valuations