(CA) Constant Individual Regret in General Games

新的ECHO-OFTRL算法提高了通用博弈中的遗憾保证

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

研究人员开发了一种名为ECHO-OFTRL的新算法，旨在改进通用博弈中的去中心化均衡寻找。该算法消除了先前在遗憾保证中看到的对时间跨度长度的多对数依赖。ECHO-OFTRL是确定性的且完全解耦的，确保每个玩家的遗憾都受到玩家数量和最大行动集大小对数的多项式函数的限制。 AI

排序理由该集群包含一篇发表在arXiv上的研究论文，详细介绍了一种新算法。[lever_c_demoted from research: ic=1 ai=1.0]

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

本文如何被排名

Signal score: 20 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该集群包含一篇发表在arXiv上的研究论文，详细介绍了一种新算法。[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: Breaking (< 6h); Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

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

arXiv cs.LG TIER_1 (CA) · Mingyang Liu, Gabriele Farina, Asuman Ozdaglar · 2026-09-01 04:00

通用博弈中的个体持续后悔

arXiv:2608.31166v1 Announce Type: new Abstract: Uncoupled no-regret dynamics provide a decentralized route to equilibrium, but prior guarantees for individual regret retain a polylogarithmic dependence on the horizon. We remove this dependence for every finite $N$-player normal-f…