@inproceedings{1cdb5ba1122a4d148b464af68865ed1e,
title = "The Query Complexity of Cake Cutting",
abstract = "We consider the query complexity of cake cutting in the standard query model and give lower and upper bounds for computing approximately envy-free, perfect, and equitable allocations with the minimum number of cuts. The lower bounds are tight for computing contiguous envy-free allocations among n = 3 players and for computing perfect and equitable allocations with minimum number of cuts between n = 2 players. For ϵ-envy-free allocations with contiguous pieces, we also give an upper bound of O(n/ϵ) and lower bound of Ω(log(1/ϵ)) queries for any number n ≥ 3 of players. We also formalize moving knife procedures and show that a large subclass of this family, which captures all the known moving knife procedures, can be simulated efficiently with arbitrarily small error in the Robertson-Webb query model.",
author = "Simina Br{\^a}nzei and Noam Nisan",
note = "Publisher Copyright: {\textcopyright} 2022 Neural information processing systems foundation. All rights reserved.; 36th Conference on Neural Information Processing Systems, NeurIPS 2022 ; Conference date: 28-11-2022 Through 09-12-2022",
year = "2022",
language = "الإنجليزيّة",
series = "Advances in Neural Information Processing Systems",
editor = "S. Koyejo and S. Mohamed and A. Agarwal and D. Belgrave and K. Cho and A. Oh",
booktitle = "Advances in Neural Information Processing Systems 35 - 36th Conference on Neural Information Processing Systems, NeurIPS 2022",
}