A note on envy-free cake cutting with polynomial valuations

DOI10.1016/J.IPL.2014.07.005MaRDI QIDQ477590zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Algorithmic solutions for envy-free cake cutting
• Cake cutting with single-peaked valuations
• A discrete and bounded envy-free cake cutting protocol for four agents
• On the complexity of cake cutting
• Cake cutting really is not a piece of cake

Cites work

• scientific article; zbMATH DE number 1234106 (Why is no real title available?)
• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• An Envy-Free Cake Division Protocol
• Cake cutting really is not a piece of cake
• How to Cut a Cake Fairly
• On the complexity of cake cutting

Cited in

(4)

• Algorithmic solutions for envy-free cake cutting
• Three persons, two cuts: a new cake-cutting algorithm
• Cake cutting with single-peaked valuations
• A discrete and bounded envy-free cake cutting protocol for four agents

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

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