English(EN) Minimizing Cumulative Envy in Allocating a Sequence of Items

新方法最小化序列物品分配中的累积嫉妒

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

研究人员开发了一种新方法，可以在分配一系列不可分割的物品时最小化累积嫉妒。该方法考虑了嫉妒随时间的持续时间和幅度，并引入“累积最大嫉妒”作为关键指标。尽管即使在简单的估值场景下，该问题也是NP难的，但该研究为固定数量的代理提出了动态规划解决方案，并为相同的整数估值提出了FPTAS。此外，一种贪婪算法为可以选择到达顺序的变体提供了近似保证。 AI

排序理由关于理论计算机科学和博弈论问题的学术论文。[lever_c_demoted from research: ic=1 ai=0.4]

在 arXiv cs.MA (Multiagent) 阅读 →

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

本文如何被排名

Signal score: 0 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 关于理论计算机科学和博弈论问题的学术论文。[lever_c_demoted from research: ic=1 ai=0.4]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
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: Standard; On-topic for AI-industry coverage; kept in the public index.
Story freshness: 8 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

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

报道来源 [1]

arXiv cs.MA (Multiagent) TIER_1 English(EN) · Nicholas Teh · 2026-10-07 11:04

最小化分配一系列物品中的累积嫉妒

We study temporal fair division with indivisible goods that arrive sequentially and must be allocated irrevocably. In contrast to the usual online model, we assume that valuations and future arrivals are known in advance, and ask how unfairness evolves during the process. We intr…

本文如何被排名

报道来源 [1]

最小化分配一系列物品中的累积嫉妒

相关实体

相关话题