Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts

DOI10.4230/lipics.isaac.2020.15OpenAlexW3117567047MaRDI QIDQ6065412

Unnamed Author, Takao Asano

Publication date: 14 November 2023

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/13359/pdf/LIPIcs-ISAAC-2020-15.pdf/

zbMATH Keywords

fairnessmechanism designcake-cutting problemenvy-freenesstruthfulness

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

On existence of truthful fair cake cutting mechanisms

Cites Work

• Unnamed Item
• Truth, justice, and cake cutting
• Envy-free cake divisions cannot be found by finite protocols
• Expand the shares together: envy-free mechanisms with a small number of cuts
• Proportional pie-cutting
• Rental Harmony: Sperner's Lemma in Fair Division
• Cake Cutting Algorithms for Piecewise Constant and Piecewise Uniform Valuations
• How to Cut a Cake Fairly
• On Representatives of Subsets
• Algorithmic Solutions for Envy-Free Cake Cutting

This page was built for publication: Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts