English(EN) Pushing the Frontier on Approximate EFX Allocations

新研究推进了近似羡慕公平的物品分配

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

研究人员在不可分割物品分配的近似羡慕公平性研究方面取得了进展。该论文介绍了关于 $2/3$-EFX 分配的新结果，这是对精确 EFX 的一种放宽。这些发现可扩展到最多七个代理的场景，或者当代理的估值函数最多有三个值时，或者可以用多图表示时。这项工作推动了近似 EFX 分配的存在性和计算的边界。 AI

排序理由关于算法博弈论的学术论文。[lever_c_demoted from research: ic=1 ai=0.1]

在 arXiv cs.AI 阅读 →

Georgios Amanatidis

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.1]
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: Low; Off-topic or adjacent — cluster remains reachable but doesn't surface in AI-industry rankings.
Story freshness: 84 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

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

报道来源 [1]

arXiv cs.AI TIER_1 English(EN) · Georgios Amanatidis, Aris Filos-Ratsikas, Alkmini Sgouritsa · 2026-07-31 04:00

推进近似 EFX 分配的边界

arXiv:2406.12413v3 Announce Type: replace-cross Abstract: We study the problem of allocating a set of indivisible goods to a set of agents with additive valuation functions, aiming to achieve approximate envy-freeness up to any good ($\alpha$-EFX). The state-of-the-art results on…

本文如何被排名

报道来源 [1]

推进近似 EFX 分配的边界

相关实体

相关话题