How to share a cake with a secret agent

DOI10.1016/j.mathsocsci.2019.04.001zbMath1426.91143arXiv1810.06913OpenAlexW2897823184WikidataQ127937517 ScholiaQ127937517MaRDI QIDQ2334821

Guillaume Chèze

Publication date: 8 November 2019

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.06913

zbMATH Keywords

fair divisionimperfect informationsecret preferences

Mathematics Subject Classification ID

Individual preferences (91B08) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

Fair multi-cake cutting

Cites Work

• A note on cake cutting
• Envy-free cake divisions cannot be found by finite protocols
• Dividing a cake fairly
• On the complexity of cake cutting
• Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm
• How to Cut A Cake Fairly
• Fair Division and Generalizations of Sperner- and KKM-type Results
• Achieving Rental Harmony with a Secretive Roommate
• An Envy-Free Cake Division Protocol
• Cake Cutting Algorithms
• A discrete and bounded envy-free cake cutting protocol for four agents
• Cake cutting really is not a piece of cake
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: How to share a cake with a secret agent