Mind the gap: cake cutting with separation

DOI10.1016/J.ARTINT.2022.103783MaRDI QIDQ2093384zbMATH OpenOpenAlexFDO

Authors Edith Elkind, Erel Segal-Halevi, Warut Suksompong

Publication date 8 November 2022

Published in Artificial Intelligence (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

cake cuttingfair divisionmaximin shareseparation

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites work

• A note on cake cutting
• Almost envy-free allocations with connected bundles
• Cake cutting algorithms
• Cake cutting really is not a piece of cake
• Cake-cutting with different entitlements: how many cuts are needed?
• Children crying at birthday parties. Why?
• Competitive equilibrium with indivisible goods and generic budgets
• Contiguous cake cutting: hardness results and approximation algorithms
• Cutting a pie is not a piece of cake
• Disproportionate division
• Envy-free cake divisions cannot be found by finite protocols
• Existence of a simple and equitable fair division: a short proof
• Fair Allocation of Indivisible Goods to Asymmetric Agents
• Fair and efficient cake division with connected pieces
• Fair cake-cutting among families
• Fair enough: guaranteeing approximate maximin shares
• Fair multi-cake cutting
• Game-theoretic algorithms for fair and strongly fair cake division with entitlements
• 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
• On the complexity of cake cutting
• On the computability of equitable divisions
• On the existence of equitable cake divisions
• Picking sequences and monotonicity in weighted fair division
• Proportional pie-cutting
• Rental Harmony: Sperner's Lemma in Fair Division
• The price of connectivity in fair division

Cited in

(6)

• Keep your distance: land division with separation
• On maximum bipartite matching with separation
• Approximate envy-freeness in graphical cake cutting
• Logarithmic algorithms for fair division problems
• Ordinal maximin guarantees for group fair division
• Fairer than fair: sharp bounds for connected super-proportional cake cutting

This page was built for publication: Mind the gap: cake cutting with separation

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