Abstract:We study collaborative learning in multi-agent Bayesian bandit problems, where strategic agents collectively solve the same bandit instance. While multiple agents can accelerate learning by sharing information, strategic agents might prefer to free-ride and avoid exploration. We consider a setting with persistent agents that participate in multiple time periods. This is in contrast to most previous works on incentives in multi-agent MAB, which assume short-lived agents, namely each agent has a single decision to make and optimizes their expected reward in that single decision. As in the multi-agent MAB model with incentives, our model does not have monetary transfers, and the only incentives are through information sharing.
We propose \texttt{CAOS}, a mechanism that sustains collaboration as a Nash equilibrium while achieving strong regret guarantees. Our results demonstrate that collaborative exploration can be sustained purely through information sharing, achieving performance close to that of fully cooperative systems despite strategic behavior.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.13145 [cs.LG] |
| (or arXiv:2605.13145v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.13145 arXiv-issued DOI via DataCite (pending registration) |
From: Idan Barnea [view email]
[v1]
Wed, 13 May 2026 08:10:36 UTC (30 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。