An improved envy-free cake cutting protocol for four agents
From MaRDI portal
Publication:1617649
DOI10.1007/978-3-319-99660-8_9zbMath1415.91170arXiv1807.00317OpenAlexW2962990022MaRDI QIDQ1617649
John Fearnley, George Christodoulou, Georgios Amanatidis, Evangelos Markakis, Eftychia Vakaliou, Christos-Alexandros Psomas
Publication date: 8 November 2018
Full work available at URL: https://arxiv.org/abs/1807.00317
Related Items
Three Persons, Two Cuts: A New Cake-Cutting Algorithm, Fair multi-cake cutting, Fair cake-cutting in practice, Computing exact solutions of consensus halving and the Borsuk-Ulam theorem, Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem, Fairly Allocating Many Goods with Few Queries, Two's company, three's a crowd: consensus-halving for a constant number of agents