Dividing a graphical cake

DOI10.1137/22M1500502MaRDI QIDQ6668347zbMATH OpenFDO

Authors Xiaohui Bei, Edith Elkind, Erel Segal-Halevi, Warut Suksompong

Publication date 22 January 2025

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1137/22M1500502

zbMATH Keywords

cake cuttingfair divisiongraph theory

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Approximate envy-freeness in graphical cake cutting
• Fair multi-cake cutting
• Fair and square: cake-cutting in two dimensions
• Envy-Free Division of Land
• Disproportionate division

Cites work

• Almost envy-free allocations with connected bundles
• Approximate envy-freeness in graphical cake cutting
• Cake cutting algorithms
• Children crying at birthday parties. Why?
• Communication complexity of discrete fair division
• Competitive division of a mixed manna
• Contiguous cake cutting: hardness results and approximation algorithms
• Cutting a pie is not a piece of cake
• Distributed fair allocation of indivisible goods
• Envy-free cake divisions cannot be found by finite protocols
• Envy-free matchings in bipartite graphs and their applications to fair division
• Fair and efficient cake division with connected pieces
• Fair and square: cake-cutting in two dimensions
• Fair division of graphs and of tangled cakes
• Fair multi-cake cutting
• How to Cut a Cake Fairly
• How to Cut A Cake Fairly
• scientific article; zbMATH DE number 1234106 (Why is no real title available?)
• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• Maximin share allocations on cycles
• Old and new moving-knife schemes
• On the computability of equitable divisions
• On the existence of equitable cake divisions
• Proportional pie-cutting
• Rental Harmony: Sperner's Lemma in Fair Division
• The price of connectivity in fair division

Cited in

(5)

• Fair division of graphs and of tangled cakes
• Approximate envy-freeness in graphical cake cutting
• When is truthfully allocating chores no harder than goods?
• Connectedness in weighted consensus division of graphical cakes between two agents
• The complexity of envy-free graph cutting

This page was built for publication: Dividing a graphical cake

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