A note on envy-free cake cutting with polynomial valuations

DOI10.1016/J.IPL.2014.07.005zbMATH Open1302.68307OpenAlexW2122453448MaRDI QIDQ477590FDOQ477590

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• How to Cut a Cake Fairly
• An Envy-Free Cake Division Protocol
• On the complexity of cake cutting
• Cake cutting really is not a piece of cake

Cited In (4)

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

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)