Mind the gap: cake cutting with separation
From MaRDI portal
Publication:2093384
DOI10.1016/j.artint.2022.103783OpenAlexW3174087519MaRDI QIDQ2093384
Edith Elkind, Warut Suksompong, Erel Segal-Halevi
Publication date: 8 November 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.06682
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on cake cutting
- Fair and efficient cake division with connected pieces
- Children crying at birthday parties. Why?
- Envy-free cake divisions cannot be found by finite protocols
- The complexity of cake cutting with unequal shares
- On the computability of equitable divisions
- Picking sequences and monotonicity in weighted fair division
- Almost envy-free allocations with connected bundles
- Fair cake-cutting among families
- Cake-cutting with different entitlements: how many cuts are needed?
- Existence of a simple and equitable fair division: a short proof
- On the complexity of cake cutting
- 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
- Fair Enough
- Fair Allocation of Indivisible Goods to Asymmetric Agents
- Game-theoretic algorithms for fair and strongly fair cake division with entitlements
- Competitive Equilibrium with Indivisible Goods and Generic Budgets
- Contiguous Cake Cutting: Hardness Results and Approximation Algorithms
- Maximin Share Allocations on Cycles
- Cake Cutting Algorithms
- Disproportionate division
- The Price of Connectivity in Fair Division
- Cake cutting really is not a piece of cake
This page was built for publication: Mind the gap: cake cutting with separation
