A discrete and bounded envy-free cake cutting protocol for four agents
From MaRDI portal
Publication:5361851
DOI10.1145/2897518.2897522zbMath1373.68251arXiv1508.05143OpenAlexW1854782908MaRDI QIDQ5361851
Publication date: 29 September 2017
Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.05143
Analysis of algorithms and problem complexity (68Q25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Agent technology and artificial intelligence (68T42)
Related Items (24)
Which is the fairest allocation in the max-min fairness-based coalitional game? ⋮ Truthful fair division without free disposal ⋮ Consensus-Halving: Does It Ever Get Easier? ⋮ Envy-free division of multi-layered cakes ⋮ Fair multi-cake cutting ⋮ Dynamic Fair Resource Division ⋮ Two birds with one stone: fairness and welfare via transfers ⋮ Fair cake-cutting in practice ⋮ Fair division of indivisible goods: recent progress and open questions ⋮ Fairly taking turns ⋮ On existence of truthful fair cake cutting mechanisms ⋮ Fair Division and Generalizations of Sperner- and KKM-type Results ⋮ Contiguous Cake Cutting: Hardness Results and Approximation Algorithms ⋮ Computing exact solutions of consensus halving and the Borsuk-Ulam theorem ⋮ Expand the shares together: envy-free mechanisms with a small number of cuts ⋮ Fair Division ⋮ Fair division of mixed divisible and indivisible goods ⋮ Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks ⋮ Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem ⋮ Fairly Allocating Many Goods with Few Queries ⋮ Fair and efficient cake division with connected pieces ⋮ How to share a cake with a secret agent ⋮ Cake cutting: explicit examples for impossibility results ⋮ Two's company, three's a crowd: consensus-halving for a constant number of agents
This page was built for publication: A discrete and bounded envy-free cake cutting protocol for four agents
