An Exponential Envy-Free Cake Cutting Protocol for $n$ Agents
Computational Complexity
2023-06-07 v1
Abstract
We consider a classical envy-free cake cutting problem. The first limited protocol was proposed by Aziz and McKenzie in 2016 arXiv:1604.03655. The disadvantage of this protocol is its high complexity. The authors proved that the maximum number of queries required by the protocol is . We made minor changes to the Aziz-Mackenzie protocol, improved estimation of the required number of queries and made an algorithm that uses at most queries.
Cite
@article{arxiv.2306.03854,
title = {An Exponential Envy-Free Cake Cutting Protocol for $n$ Agents},
author = {Georgy Sokolov},
journal= {arXiv preprint arXiv:2306.03854},
year = {2023}
}
Comments
in Russian, 31 pages