跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.20890 · v1

Nearly Settling the Complexity of Connected $\varepsilon$-Envy-Free Cake Cutting

首次提交 2026-11-16 18:59
版本更新 2026-11-16 18:59
雷达观测 2026-11-17 17:11
arXiv ↗PDF ↗

摘要

Envy-free cake cutting has been one of the central problems in fair division. In cake cutting, agents' preferences over the cake are accessed through Robertson--Webb (RW) queries. For three or more agents, no algorithm that makes finitely many RW queries can always find a contiguous, exactly envy-free allocation. For contiguous ε\varepsilon-envy-free allocations, however, Hollender and Rubinstein~(JACM, 2025) showed that $\poly(\log(1/\varepsilon))$ RW queries suffice for four agents, leaving open whether such a bound is possible for five or more agents. In this paper, we establish a striking change in query complexity: $\poly(\log(1/\varepsilon))$ RW queries suffice for up to five agents, whereas (1/ε)Ω(1)(1/\varepsilon)^{Ω(1)} queries are necessary for seven or more agents, even when valuations are additive. Thus, we resolve the five-agent case and, more broadly, determine whether polylogarithmic query complexity is possible for every number of agents except six. We also explore the computational complexity of finding contiguous ε\varepsilon-envy-free allocations. When monotone Lipschitz valuations are given by polynomial-time evaluation procedures (e.g., arithmetic circuits and efficiently computable Turing machines), we show that an ε\varepsilon-envy-free division can be computed in polynomial time for five agents. In contrast, even for additive valuations, finding an ε\varepsilon-envy-free division is UEOPL-hard for every fixed number of agents n≥7n\ge7 and PPAD-complete for every fixed n≥13n\ge13.

作者备注:Comments: 67 pages, 2 figures

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-16 18:59 · 最新观测版本

Nearly Settling the Complexity of Connected $\varepsilon$-Envy-Free Cake Cutting

Envy-free cake cutting has been one of the central problems in fair division. In cake cutting, agents' preferences over the cake are accessed through Robertson--Webb (RW) queries. For three or more agents, no algorithm that makes finitely many RW queries can always find a contiguous, exactly envy-free allocation. For contiguous ε\varepsilon-envy-free allocations, however, Hollender and Rubinstein~(JACM, 2025) showed that $\poly(\log(1/\varepsilon))$ RW queries suffice for four agents, leaving open whether such a bound is possible for five or more agents. In this paper, we establish a striking change in query complexity: $\poly(\log(1/\varepsilon))$ RW queries suffice for up to five agents, whereas (1/ε)Ω(1)(1/\varepsilon)^{Ω(1)} queries are necessary for seven or more agents, even when valuations are additive. Thus, we resolve the five-agent case and, more broadly, determine whether polylogarithmic query complexity is possible for every number of agents except six. We also explore the computational complexity of finding contiguous ε\varepsilon-envy-free allocations. When monotone Lipschitz valuations are given by polynomial-time evaluation procedures (e.g., arithmetic circuits and efficiently computable Turing machines), we show that an ε\varepsilon-envy-free division can be computed in polynomial time for five agents. In contrast, even for additive valuations, finding an ε\varepsilon-envy-free division is UEOPL-hard for every fixed number of agents n≥7n\ge7 and PPAD-complete for every fixed n≥13n\ge13.

查看此版本解读 →查看此版本原文 ↗