Dividing a graphical cake
From MaRDI portal
Publication:6668347
DOI10.1137/22m1500502MaRDI QIDQ6668347
Could not fetch data.
Publication date: 22 January 2025
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distributed fair allocation of indivisible goods
- Fair and efficient cake division with connected pieces
- Children crying at birthday parties. Why?
- Envy-free cake divisions cannot be found by finite protocols
- Old and new moving-knife schemes
- On the computability of equitable divisions
- Almost envy-free allocations with connected bundles
- Fair and square: cake-cutting in two dimensions
- Proportional pie-cutting
- On the existence of equitable cake divisions
- Fair multi-cake cutting
- Rental Harmony: Sperner's Lemma in Fair Division
- How to Cut A Cake Fairly
- How to Cut a Cake Fairly
- Competitive Division of a Mixed Manna
- Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
- Maximin Share Allocations on Cycles
- Cake Cutting Algorithms
- The Price of Connectivity in Fair Division
- Fairly allocating contiguous blocks of indivisible items
- Fair division of graphs and of tangled cakes
- Envy-free matchings in bipartite graphs and their applications to fair division
- Approximate envy-freeness in graphical cake cutting
- Communication complexity of discrete fair division
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)
