English(EN) Exact Cut Complexity of Equal-Length Proportional Cake Cutting

分蛋糕研究解决比例分配复杂度问题 · 2篇论文

作者 PulseAugur 编辑部 · [3 个来源] · 2026-10-14 07:11

两篇新研究论文探讨了比例分蛋糕的复杂性，这是一个多智能体系统中的理论问题。第一篇论文确定了保证等长比例分配所需的精确最坏情况切割次数，改进了先前的界限并讨论了计算可行性。第二篇论文证明了即使在简化的估值条件下，计算连续无嫉妒蛋糕分配也是PPAD-完全的，突显了此类问题的计算难度。 AI

影响这些论文探讨了公平资源分配的理论基础，与多智能体AI系统相关。

排序理由两篇在arXiv上发表的关于理论计算机科学问题的学术论文。

AI 生成摘要 · Google Gemini · 来自 3 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 2 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Research; 两篇在arXiv上发表的关于理论计算机科学问题的学术论文。
Source corroboration: 3 independent sources; Multiple independent publishers reporting the same story raises confidence that it's real and newsworthy.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: High; Clearly on-topic for AI-industry coverage.
Story freshness: 1 days old; Coverage has settled into its steady-state source set.
Coverage growth since scoring: +1 source(s) since last score; New sources have picked up this story since our last re-score. Score will update on the next scoring pass.

完整方法见我们的编辑标准。

arXiv cs.MA (Multiagent) TIER_1 English(EN) · Mohammad Azharuddin Sanpui · 2026-10-14 07:54

等长比例分割问题的精确割复杂度

We study proportional cake cutting under an equal-length constraint, where each of $n$ agents must receive a bundle of length exactly $1/n$ that is worth at least $1/n$ to that agent. Our main result determines the exact worst-case number of cuts needed to guarantee such an alloc…
arXiv cs.MA (Multiagent) TIER_1 English(EN) · Mohammad Azharuddin Sanpui · 2026-10-14 07:11

PPAD-具有加性估值的连续公平分割蛋糕的完备性

We prove that computing a complete contiguous $\varepsilon$-envy-free cake allocation is PPAD-complete for normalized rational piecewise-constant additive valuations. The hardness holds even when $\varepsilon$ is given in unary, and even when every density takes only two values, …
Hugging Face Daily Papers TIER_1 English(EN) · 2026-10-14 07:11

具有加性估值的连续公平分割蛋糕的PPAD完备性

We prove that computing a complete contiguous $\varepsilon$-envy-free cake allocation is PPAD-complete for normalized rational piecewise-constant additive valuations. The hardness holds even when $\varepsilon$ is given in unary, and even when every density takes only two values, …