← 研踪 PaperTrailarXiv:2611.24167 · v1
On the Complexity of Envy Cycle Elimination
首次提交 2026-11-18 18:08
版本更新 2026-11-18 18:08
雷达观测 2026-11-19 15:04
摘要
The envy cycle elimination (ECE) algorithm is a fundamental algorithm for the fair allocation of indivisible goods, guaranteeing an allocation that is envy-free up to one good under arbitrary monotone utilities. We show that the ECE algorithm can be implemented in time for agents and goods, and establish the tightness of this bound.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-18 18:08 · 最新观测版本
On the Complexity of Envy Cycle Elimination
The envy cycle elimination (ECE) algorithm is a fundamental algorithm for the fair allocation of indivisible goods, guaranteeing an allocation that is envy-free up to one good under arbitrary monotone utilities. We show that the ECE algorithm can be implemented in time for agents and goods, and establish the tightness of this bound.
查看此版本解读 →查看此版本原文 ↗