按年被提到
20192020 · 2 次2026
强化学习与智能体›博弈与游戏 AI·arXiv:1912.02318 · cs.AI

Improving Policies via Search in Cooperative Partially Observable Games

Adam Lerer, Hengyuan Hu, Jakob Foerster, Noam Brown · 2019
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2020-07-18 · 最近 2020-09-11
2不同的人
2活跃月份
2讨论串
7被引(OpenAlex)
arXiv 摘要(候选层不写导读)

Recent superhuman results in games have largely been achieved in a variety of zero-sum settings, such as Go and Poker, in which agents need to compete against others. However, just like humans, real-world AI systems have to coordinate and communicate with other agents in cooperative partially observable environments as well. These settings commonly require participants to both interpret the actions of others and to act in a way that is informative when being interpreted. Those abilities are typically summarized as theory f mind and are seen as crucial for social interactions. In this paper we propose two different search techniques that can be applied to improve an arbitrary agreed-upon policy in a cooperative partially observable game. The first one, single-agent search, effectively converts the problem into a single agent setting by making all but one of the agents play according to the agreed-upon policy. In contrast, in multi-agent search all agents carry out the same common-knowledge search procedure whenever doing so is computationally feasible, and fall back to playing according to the agreed-upon policy otherwise. We prove that these search procedures are theoretically guaranteed to at least maintain the original performance of the agreed-upon policy (up to a bounded approximation error). In the benchmark challenge problem of Hanabi, our search technique greatly improves the performance of every agent we tested and when applied to a policy trained using RL achieves a new state-of-the-art score of 24.61 / 25 in the game, compared to a previous-best of 24.08 / 25.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论gwenzek · 2020-07

“Hanabi has been solved a few months after deepmind "new frontier" paper: https://arxiv.org/abs/1912.02318 They reach a score of 24.6/25. Knowing that there are some losing hands.”

List of Modern Boardgame Research原评论 ↗
评论3PS · 2020-09

“Recently there has been a growing interest in developing AI for cooperative games, like Hanabi. I believe the challenge originated from a paper by Google Brain/DeepMind [1], but several other groups have tackled it, including Facebook AI Research [2]. [1] https://www.sciencedirect.com/science/article/pii/S0004370219300116 [2] https://arxiv.org/pdf/1912.…”

Exploring new forms of chess using artificial intelligence原评论 ↗