Cake Cutting Algorithms
From MaRDI portal
Publication:5133016
DOI10.1017/cbo9781107446984.014zbMath1448.91139OpenAlexW1182014237MaRDI QIDQ5133016
Publication date: 12 November 2020
Full work available at URL: https://doi.org/10.1017/cbo9781107446984.014
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Algorithms in computer science (68W99)
Related Items (26)
Envy-free allocations respecting social networks ⋮ Truthful fair division without free disposal ⋮ Fair distributions for more participants than allocations ⋮ Allocating indivisible goods to strategic agents: pure Nash equilibria and fairness ⋮ A survey of mass partitions ⋮ Distributed fair allocation of indivisible goods ⋮ Maximum Nash welfare and other stories about EFX ⋮ Fair multi-cake cutting ⋮ Existence of a simple and equitable fair division: a short proof ⋮ Fairness and efficiency in cake-cutting with single-peaked preferences ⋮ Fair cake-cutting in practice ⋮ Fair cake-cutting for imitative agents ⋮ Fair division of goods in the shadow of market values ⋮ Fair division of indivisible goods: recent progress and open questions ⋮ On fairness via picking sequences in allocation of indivisible goods ⋮ Contiguous Cake Cutting: Hardness Results and Approximation Algorithms ⋮ Expand the shares together: envy-free mechanisms with a small number of cuts ⋮ Fair division of mixed divisible and indivisible goods ⋮ Fair allocation of indivisible goods with minimum inequality or minimum envy ⋮ Unnamed Item ⋮ Almost envy-free allocations with connected bundles ⋮ How to share a cake with a secret agent ⋮ Cake cutting: explicit examples for impossibility results ⋮ Mind the gap: cake cutting with separation ⋮ Two's company, three's a crowd: consensus-halving for a constant number of agents ⋮ Obvious manipulations in cake-cutting
This page was built for publication: Cake Cutting Algorithms
