Fair division of graphs and of tangled cakes

DOI10.1007/s10107-023-01945-5arXiv2102.08560OpenAlexW3129431470MaRDI QIDQ6120940

Ayumi Igarashi, William S. Zwicker

Publication date: 21 February 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

graphsfair divisiontanglescake cuttingenvy-freeness

Mathematics Subject Classification ID

Applications of graph theory (05C90) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Unnamed Item
• Dividing a cake fairly
• Cake division with minimal cuts: envy-free procedures for three persons, four persons, and beyond
• Almost envy-free allocations with connected bundles
• Rental Harmony: Sperner's Lemma in Fair Division
• How to Cut a Cake Fairly
• A moving-knife solution to the four-person envy-free cake-division problem
• Non-Separable and Planar Graphs
• Maximin Share Allocations on Cycles
• The Price of Connectivity in Fair Division

This page was built for publication: Fair division of graphs and of tangled cakes