English(EN) Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness

新研究探讨将不可分割物品公平分配给战略代理

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

本文探讨了将不可分割的物品公平分配给具有加性估值的战略代理的机制。研究重点关注机制是否能在保证公平性的同时，也保证纯纳什均衡，特别是“最多一件 envy-freeness”（EF1）和“任意一件 envy-freeness”（EFX）。研究发现，轮流分配算法的纯纳什均衡可以实现 EF1 分配，而 Plaut 和 Roughgarden 的“分割与选择”算法可以实现 EFX 分配，同时满足两个代理的最大最小份额公平性。 AI

排序理由该集群包含一篇关于理论计算机科学主题的学术论文。[lever_c_demoted from research: ic=1 ai=0.4]

在 arXiv cs.AI 阅读 →

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

本文如何被排名

Signal score: 1 / 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: Same-day; Cluster formed today. Ranking reflects the current source set at time of score.

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

报道来源 [1]

arXiv cs.AI TIER_1 English(EN) · Georgios Amanatidis, Georgios Birmpas, Federico Fusco, Philip Lazos, Stefano Leonardi, Rebecca Reiffenh\"auser · 2026-10-23 04:00

将不可分割物品分配给策略性代理：纯纳什均衡与公平性

arXiv:2109.08644v3 Announce Type: replace-cross Abstract: We consider the problem of fairly allocating a set of indivisible goods to a set of strategic agents with additive valuation functions. We assume no monetary transfers and, therefore, a mechanism in our setting is an algor…

本文如何被排名

报道来源 [1]

将不可分割物品分配给策略性代理：纯纳什均衡与公平性

相关实体

相关话题