新协议解决了通信受限的对抗性多人老虎机问题

作者 PulseAugur 编辑部 · [1 个来源] · 2026-10-05 02:03

研究人员开发了一种新的对抗性多人老虎机协议，专门针对具有多个玩家、通信受限且没有共享随机性的场景。所提出的方法使用蒙特卡洛公共构造器来建立共同的学习计划并在学习开始前同步玩家。该协议确保即使在反馈最少的情况下，遗憾也能得到限制，并在交换分配和分数的同时保持有效的奖励估计。 AI

影响为多智能体在老虎机环境中的学习引入了一种新颖的协议，有可能提高分布式系统的协调性和效率。

排序理由学术论文，详细介绍了一种针对特定类型老虎机问题的新协议。[lever_c_demoted from research: ic=1 ai=1.0]

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=1.0]
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: High; Clearly on-topic for AI-industry coverage.
Story freshness: 1 days old; Coverage has settled into its steady-state source set.

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

arXiv cs.MA (Multiagent) TIER_1 English(EN) · Chenyu Gan · 2026-10-05 02:03

无碰撞信息或共享随机性的对抗性多人老虎机问题的平方根遗憾

We study adversarial multiplayer bandits with $K$ arms and $2\le m<K$ labeled players, without collision information, shared randomness, or an external communication channel. We design a constructive communication and synchronization protocol with a Monte Carlo public constructor…